登录
首页 » JavaScript » Secrets-of-the-JavaScript-Ninja.pdf

Secrets-of-the-JavaScript-Ninja.pdf

于 2014-08-13 发布 文件大小:7013KB
0 187
下载积分: 1 下载次数: 1

代码说明:

  Secrets of the JavaScript Ninja 作者: John Resig / Bear Bibeault (Secrets of the JavaScript Ninja)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • uploadservlet
    Java上传文件的源码(Java source code)
    2004-09-16 12:59:51下载
    积分:1
  • 基于Socket的即时通信系统(聊天室)
    【实例简介】
    2021-09-29 00:31:05下载
    积分:1
  • right
    springmvc security 权限管理例子(springmvc security )
    2015-03-31 10:06:12下载
    积分:1
  • CFOPJAVA
    魔方 java F2L OLL PLL 3D 动画(Cube java F2L OLL PLL 3D Animation)
    2010-05-22 01:24:53下载
    积分:1
  • 廖雪峰的JavaScript python git
    廖雪峰的JavaScript python git,非常经典(Liao Xuefeng JavaScript python git)
    2017-11-19 15:23:07下载
    积分:1
  • myProduct
    在STRUTS和SPRING整合框架下开发的一个商品管理模块,供学习框架的初学者参考(Integration of STRUTS and SPRING in the framework of the development of a product management module for beginners learning framework reference)
    2010-05-15 23:23:30下载
    积分:1
  • 11
    说明:  一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。要求:分别用普通方法和递归方法实现(A frog can jump up a step or two at a time. Find out how many jumping methods the frog can use to jump up an n-step. Requirements: Implemented by common method and recursive method respectively)
    2019-03-10 16:48:12下载
    积分:1
  • java-control-LED
    java 编写的一个控制LED显示屏的工具(java control what appear on led.)
    2014-09-03 15:56:52下载
    积分:1
  • AIWordSplit
    直接运行compile.bat和run.bat即可 使用了3种分词方法: 1.正向最大匹配(ForwardMatch.java) 2.逆向最大匹配(ForwardMatch.java) 3.最大频率匹配(FrequencyMatch.java)(默认) 取频率最高的词,然后两端递归,构建二杈树存储句子中的词语,显示的时候使用中序遍历二杈树 由于极有可能单个字的使用频率比整个词还高,筛选的时候进行了处理 若单个字不处于当前句子开头,先忽略, 若单个的字处在开头,临时mostFrequency仍为0,且单词长度为1,则加入到二杈树中(Can be run directly compile.bat and run.bat used three kinds of segmentation methods: 1. Being the biggest match (ForwardMatch.java) 2. Reverse maximum matching (ForwardMatch.java) 3. Maximum frequency matching (FrequencyMatch.java) ( default) to take the highest frequency words, and then both ends of the recursive construct two Cha tree storage sentence terms, when used in the sequence shows two Cha tree traversal is very likely because the use of a single word frequency is higher than the whole word, screening If the time were dealing with a single word is not in the beginning of the current sentence, first ignored, if a single word at the beginning of the temporary mostFrequency still 0, and the word length of 1, to 2 Cha tree)
    2010-05-28 10:23:21下载
    积分:1
  • fileupload
    ftp文件上传,applet界面,带进度条(ftp file upload, applet interface, with a progress bar)
    2009-10-13 10:14:05下载
    积分:1
  • 696516资源总数
  • 106446会员总数
  • 9今日下载