虫虫首页|资源下载|资源专辑|精品软件
登录|注册

L-EDIT

  • MD5 加 密的V i s u a l C + + S o u r c e C o d e .

    MD5 加 密的V i s u a l C + + S o u r c e C o d e .

    标签: MD5

    上传时间: 2014-01-04

    上传用户:lunshaomo

  • by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See

    by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) the text of Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon

    标签: L. published Schwartz Edition

    上传时间: 2014-11-28

    上传用户:kr770906

  • by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See

    by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon

    标签: L. published Schwartz Edition

    上传时间: 2015-09-03

    上传用户:lifangyuan12

  • SimMetrics is a Similarity Metric Library, e.g. from edit distance s (Levenshtein, Gotoh, Jaro etc)

    SimMetrics is a Similarity Metric Library, e.g. from edit distance s (Levenshtein, Gotoh, Jaro etc) to other metrics, (e.g Soundex, Chapman). Work provided by UK Sheffield University funded by (AKT) an IRC sponsored by EPSRC, grant number GR/N15764/01.

    标签: e.g. Levenshtein SimMetrics Similarity

    上传时间: 2014-01-21

    上传用户:cc1

  • L为桩长

    L为桩长,r为计算点与桩轴线的水平距离,z为计算点距离地面深度。都取正值 %f1,f2,f3依次是点荷载、均布荷载以及三角形荷载下的Geddes应力解函数 %Ip,Ir,It依次是对应三个荷载下的应力系数,负表示拉,正表示压

    标签:

    上传时间: 2014-05-23

    上传用户:xuanjie

  • 叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( )为输入结束标志,输入数列L,生成二叉排序树T; (2)对二叉排序树T作中序遍历,输出结果; (3)计算

    叉排序树与平衡二叉排序树基本操作的实现 用二叉链表作存储结构 (1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T; (2)对二叉排序树T作中序遍历,输出结果; (3)计算二叉排序树T的平均查找长度,输出结果; (4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结 点,并作中序遍历(执行操作2);否则输出信息“无结点x”; (5)判断二叉排序树T是否为平衡二叉树,输出信息“OK!”/“NO!”;

    标签: 排序 基本操作 存储结构

    上传时间: 2013-12-22

    上传用户:wab1981

  • 该源码是一个问题的解决方法。问题是给你个长为L的串

    该源码是一个问题的解决方法。问题是给你个长为L的串,串中可以出现n种字符,还给出m个子串,求有多少个长为n的只由这些字串组成的串。输入例子:4 5 6 ABB BCA BCD CAB CDD DDA 结果为2.而5 4 5 E D C B A的结果为625

    标签: 源码

    上传时间: 2014-01-12

    上传用户:水中浮云

  • It is a software which can be used to open some file and edit it

    It is a software which can be used to open some file and edit it

    标签: software which file edit

    上传时间: 2015-09-13

    上传用户:米卡

  • 链表L

    链表L,创建公有成员函数Split(A,B ),创建2个新表A,B,使的A 中含有L中奇数位置元数,B中含L偶数位置元数

    标签:

    上传时间: 2014-01-13

    上传用户:磊子226

  • 有向直线K中值问题 给定一条有向直线L以及L 上的n+1 个点x0<x1<x2<… <xn。有向直线L 上的每个点xi都有一个权 w(xi) 每条有向边 (xi,xi-1)

    有向直线K中值问题 给定一条有向直线L以及L 上的n+1 个点x0<x1<x2<… <xn。有向直线L 上的每个点xi都有一个权 w(xi) 每条有向边 (xi,xi-1),也都有一个非负边长d(xi,xi-1)。有向直线L 上的每个点xi 可以看作客户,其服务需求量为w(xi) 。每条边(xi,xi-1) 的边长 , d(xi,xi-1) 可以看作运输费用。如果在点xi 处未设置服务机构,则将点xi 处的服务需求沿有向边转移到点xj处服务机构需付出的服务转移费用为w(xi)*d(xi,xj) 。在点0 x 处已设置了服务机构,现在要在直线L上增设k处服务机构,使得整体服务转移费用最小。

    标签: lt xi 直线 xn

    上传时间: 2014-01-13

    上传用户:manlian