首页
学习
活动
专区
圈层
工具
发布
    • 综合排序
    • 最热优先
    • 最新优先
    时间不限
  • 来自专栏sktj

    python 目录复制类 脚本

    self.fromDirLen:]) if self.trace: print('d', dirpath, '=>', toPath) os.mkdir(toPath) self.dcount fromDir, toDir, trace) walker.run(startDir=fromDir) print('Copied', walker.fcount, 'files,', walker.dcount is directories, 2 adds files """ def init(self, context=None, trace=2): self.fcount = 0 self.dcount def reset(self): # to reuse walker self.fcount = self.dcount visitor.run(sys.argv[2]) print('Visited %d files and %d dirs' % (visitor.fcount, visitor.dcount

    73620编辑于 2022-05-13
  • 来自专栏sktj

    python 目录复制 脚本

    platforms; may need to do more file type checking on Unix: skip links, fifos, etc. """ fcount = dcount pathTo) # recur into subdirs fcount += below[0] # add subdir counts dcount += below[1] dcount += 1 except: print('Error creating', pathTo, '--skipped') print(sys.exc_info( )[0], sys.exc_info()[1]) return (fcount, dcount) def getargs(): """ Get and verify directory name start = time.clock() fcount, dcount = copytree(*dirstuple) print('Copied', fcount, 'files,', dcount

    1K10编辑于 2022-05-13
  • 来自专栏OpenFPGA

    【手撕代码】同步 FIFO、LIFO/Stack

    {default: '0} ; wrptr_rg <= 0 ; rdptr_rg <= 0 ; dcount_rg rden_s) begin // Write operation dcount_rg <= dcount_rg + 1 ; end wren_s && rden_s) begin // Read operation dcount_rg <= dcount_rg - 1 ; 1'b1 : 0 ; assign empty_s = (dcount_rg == 0 ) ? 1'b1 : 0 ; assign o_alm_empty = (dcount_rg < LOW_TH) ?

    52820编辑于 2023-08-30
  • 来自专栏静谧的小码农

    ComboBox下拉框中多条数据结合时不整齐的解决方式

    padRightEx(string str, int totalByteCount)        { Encoding coding = Encoding.GetEncoding("gb2312"); int dcount str.ToCharArray())             { if (coding.GetByteCount(ch.ToString()) == 2)                     dcount ++;             } string w = str.PadRight(totalByteCount - dcount); return w;        } 运用代码: ?

    1K30发布于 2019-01-11
  • 来自专栏sktj

    python 查找文件、删除、搜索类 脚本

    changeto, listonly) walker.run(rootdir) print('Visited %d files and %d dirs,' % (walker.fcount, walker.dcount print('Visited %d files and %d dirs' % (walker.fcount, walker.dcount)) walker.context.sort() pprint.pprint is directories, 2 adds files """ def init(self, context=None, trace=2): self.fcount = 0 self.dcount def reset(self): # to reuse walker self.fcount = self.dcount visitor.run(sys.argv[2]) print('Visited %d files and %d dirs' % (visitor.fcount, visitor.dcount

    86530编辑于 2022-05-13
  • 来自专栏sktj

    python ftp工具类 上传、下载文件夹 封装类

    python import os, ftptools class UploadAll(ftptools.FtpTools): def init(self): self.fcount = self.dcount ') # change back up self.dcount += 1 print('directory exited ftp.run(transferAct = lambda: ftp.uploadDir(ftp.localdir)) print('Done:', ftp.fcount, 'files and', ftp.dcount back up self.connection.rmd(fname) # delete empty remote dir self.dcount training', user='lutz') ftp.run(cleanTarget=ftp.cleanDir) print('Done:', ftp.fcount, 'files and', ftp.dcount

    1.5K30编辑于 2022-05-13
  • 来自专栏sktj

    python 代码总行数统计 脚本

    SourceLines() walker.run(sys.argv[1]) print('Visited %d files and %d dirs' % (walker.fcount, walker.dcount is directories, 2 adds files """ def init(self, context=None, trace=2): self.fcount = 0 self.dcount def reset(self): # to reuse walker self.fcount = self.dcount independent walks def visitdir(self, dirpath): # called for each dir self.dcount visitor.run(sys.argv[2]) print('Visited %d files and %d dirs' % (visitor.fcount, visitor.dcount

    1.3K30编辑于 2022-05-13
  • 来自专栏sktj

    python 遍历目录类 脚本

    is directories, 2 adds files """ def init(self, context=None, trace=2): self.fcount = 0 self.dcount def reset(self): # to reuse walker self.fcount = self.dcount independent walks def visitdir(self, dirpath): # called for each dir self.dcount visitor.run(sys.argv[2]) print('Visited %d files and %d dirs' % (visitor.fcount, visitor.dcount

    92930编辑于 2022-05-13
  • 来自专栏技术圈

    KMP、BM、Sunday等字符串匹配算法及实现

    return i; } public static int sunday(String pattern,String text){ int i=0; int j=0; int dcount flag){ j=0; dcount =0; flag = false; System.out.print(i); while(! flag&&j<pattern.length()&&i<text.length()&&text.charAt(i)==pattern.charAt(j)){ dcount++; if(dcount =pattern.charAt(j)){ location = getLocation(pattern,text,pattern.length()+i-dcount); if(location =-1) {i =i+pattern.length()-dcount-location;} else{ i=i+pattern.length()+1-dcount;

    81120发布于 2019-08-22
  • 来自专栏TechBlog

    FPGA实验3时序逻辑电路-计数器设计

    U0(.clk(clk),.dout(dout_1),.num(num[3:0]),.rst(rst)); bit1Dcount U1(.clk(dout_1),.dout(dout_2),.num (num[7:4]),.rst(rst)); bit1Dcount U2(.clk(dout_2),.dout(dout_3),.num(num[11:8]),.rst(rst)); bit1Dcount U3(.clk(dout_3),.dout(dout_4),.num(num[15:12]),.rst(rst)); bit1Dcount U4(.clk(dout_4),.dout(dout_5 ),.num(num[19:16]),.rst(rst)); bit1Dcount U5(.clk(dout_5),.dout(dout_6),.num(num[23:20]),.rst(rst)) ; bit1Dcount U6(.clk(dout_6),.dout(dout_7),.num(num[27:24]),.rst(rst)); bit1Dcount U7(.clk(dout_7

    1.8K20编辑于 2022-07-20
  • 来自专栏全栈程序员必看

    c++中CreateEvent函数「建议收藏」

    ; } //DWORD dCount = ResumeThread(hThread); //cout << LOWORD(dCount) << endl; ; } //DWORD dCount = ResumeThread(hThread); //cout << LOWORD(dCount) << endl; ; } //DWORD dCount = ResumeThread(hThread); //cout << LOWORD(dCount) << endl; ; } //DWORD dCount = ResumeThread(hThread); //cout << LOWORD(dCount) << endl;

    2.2K20编辑于 2022-09-14
  • 来自专栏YoungGy

    LSA概述与实例

    self.stopwords = stopwords self.ignorechars = ignorechars self.wdict = {} self.dcount continue elif w in self.wdict: self.wdict[w].append(self.dcount else: #考虑wdict['book']会不会出现[0,0]如果book在0中出现两次 self.wdict[w] = [self.dcount ] self.dcount += 1 def build(self): self.keys = [k for k in self.wdict.keys () if len(self.wdict[k]) > 1] self.keys.sort() self.A = zeros([len(self.keys), self.dcount

    71860发布于 2018-01-03
  • 来自专栏前端资源

    Umi for React项目mock数据的使用

    数值生成规则 有 7 种格式: 'name|min-max': value 'name|count': value 'name|min-max.dmin-dmax': value 'name|min-max.dcount ': value 'name|count.dmin-dmax': value 'name|count.dcount': value 'name|+step': value 详细规则可以参考官方文档。

    2.7K30编辑于 2022-09-16
  • 来自专栏IT技术分享社区

    办公技巧:EXCEL10个常用函数介绍

    8、DCOUNT函数 函数名称:DCOUNT 主要功能:返回数据库或列表的列中满足指定条件并且包含数字的单元格数目。  使用格式:DCOUNT(database,field,criteria)   参数说明:Database表示需要统计的单元格区域;Field表示函数所使用的数据列(在第一行必须要有标志项);Criteria 应用举例:在F4单元格中输入公式:=DCOUNT(A1:D11,"语文",F1:G2),确认后即可求出“语文”列中,成绩大于等于70,而小于80的数值单元格数目(相当于分数段人数)。

    3.2K31编辑于 2022-02-17
  • 来自专栏IMWeb前端团队

    Mock.js前端开发cgi数据模拟工具

    生成规则 有 7 种格式: 'name|min-max': value 'name|count': value 'name|min-max.dmin-dmax': value 'name|min-max.dcount ': value 'name|count.dmin-dmax': value 'name|count.dcount': value 'name|+step': value   生成规则的含义需要依赖属性值才能确定

    1.8K10发布于 2019-12-03
  • 来自专栏QGS星球

    一文读懂前端数据模型MockJS

    name|min-max':value 'name|count': value 'name|min-max.dmin-dmax': value 'name|min-max.dcount ': value 'name|count.dmin-dmax': value 'name|count.dcount': value 'name|+step': value

    75230编辑于 2023-12-20
  • 来自专栏IMWeb前端团队

    Mock.js前端开发cgi数据模拟工具

    生成规则 有 7 种格式: 'name|min-max': value 'name|count': value 'name|min-max.dmin-dmax': value 'name|min-max.dcount ': value 'name|count.dmin-dmax': value 'name|count.dcount': value 'name|+step': value ??

    2.6K80发布于 2017-12-29
  • 来自专栏datartisan

    ACCESS高级--域聚合函数

    域聚合函数语法 函数名("字段名", "表名", "表达式" ) 常见的域聚合函数 DSum:字段合计 DAvg:字段均值 DCount:字段计数 DLookup:满足匹配条件的指定字段的第一个值

    2.2K10发布于 2019-12-26
  • 来自专栏腾讯云IoT

    【IoT应用创新大赛】基于TencentOS tiny的 智能 家居总控系统

    GPIO_PIN_13,GPIO_MODE_OUTPUT_PP); tos_task_delay(1000); DHT11_Data_TypeDef dataaaa; int tempdoor=0,dcount =door){//若门变更状态长达6秒则更改门状态 dcount++; if(dcount>3){ changedoor(tempdoor);//上报 } }else dcount

    1.4K53发布于 2020-04-20
  • 来自专栏编程之禅

    品优购(IDEA版)-第二天

    = brandMapper.deleteByPrimaryKey(id); System.out.println(dcount); } 日志: ==> Preparing: DELETE FROM = brandMapper.deleteByExample(example); System.out.println(dcount); } 日志: ==> Preparing: DELETE = brandMapper.delete(brand); System.out.println(dcount); } 日志: ==> Preparing: DELETE FROM tb_brand delete") public Result delete(@RequestBody List<Long> ids){ try { //根据ID删除数据 int dcount = brandService.deleteByIds(ids); if(dcount>0){ return new Result(true,"品牌删除成功")

    9.3K10发布于 2020-08-12
领券