• C# 遍历指定目录下的所有文件及文件夹以及遍历数据库的方法


    // DirectoryInfo di = new DirectoryInfo(@"D:Test");
    // FindFile(di); 
    static void FindFile(DirectoryInfo di)
    {
      FileInfo[] fis = di.GetFiles();
      for (int i = 0; i < fis.Length; i++)
      {
        Console.WriteLine("文件:" + fis[i].FullName);
      }
      DirectoryInfo[] dis = di.GetDirectories();
      for (int j = 0; j < dis.Length; j++)
      {
        Console.WriteLine("目录:" + dis[j].FullName);
        FindFile(dis[j]);
      }
    }

    根据父级遍历全部数据

           BaseOrganizeManager organizeManager = new BaseOrganizeManager();
            int count = 0;
            JsonResult<string> reult = null;
            void FindChild(List<BaseOrganizeEntity> organizeEntities)
            {
                foreach (var item in organizeEntities)
                {
                    if (item.Enabled == 0 || item.DeletionStateCode == 1)
                    {
                        continue;
                    }
                    reult = CaiNiaoAPIUtilities.SyncOrganizeToCaiNiao(item);
                    System.Console.WriteLine(count + ",执行同步:" + item.FullName + "," + DateTime.Now);
                    System.Console.WriteLine("返回" + reult.Data + "," + DateTime.Now);
                    count++;
    
                }
                List<BaseOrganizeEntity> organizeChids = null;
                string where = string.Empty;
                foreach (var item in organizeEntities)
                {
                    where = BaseOrganizeEntity.FieldParentId + " = '" + item.Id + "' ";
                    organizeChids = organizeManager.GetList<BaseOrganizeEntity>(where);
                    FindChild(organizeChids);
                }
            }
                string where = BaseOrganizeEntity.FieldParentId + " IS NULL ";
                List<BaseOrganizeEntity> organizeEntities = organizeManager.GetList<BaseOrganizeEntity>(where);
                FindChild(organizeEntities);
  • 相关阅读:
    bzoj3160(FFT+回文自动机)
    bzoj2555(后缀自动机+LCT)
    luogu P4299 首都
    Annihilate(SA)
    [FJOI2016]神秘数(脑洞+可持久化)
    [ZJOI2016]大森林(LCT)
    bzoj3756pty的字符串(后缀自动机+计数)
    UVa 11582 Colossal Fibonacci Numbers! (斐波那契循环节 & 快速幂)
    UVa 12563 Jin Ge Jin Qu hao (0-1背包)
    UVa 437 The Tower of Babylon (DAG最长路)
  • 原文地址:https://www.cnblogs.com/hnsongbiao/p/8401052.html
Copyright © 2020-2023  润新知