登录
首页 » JavaScript » webtorrent-master

webtorrent-master

于 2013-12-30 发布 文件大小:535KB
0 166
下载积分: 1 下载次数: 2

代码说明:

  web做的torrent程序,从https://raw.github.com/feross/webtorrent上面弄来的(torrent on web)

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

发表评论


0 个回复

  • 710013
    串口的通讯类,实现了串口通讯功能,解压后添加到VC工程里即可(A serial port communication, realize the function of serial port communication, after decompression can be added to the VC project)
    2017-06-10 16:12:40下载
    积分:1
  • dfim
    control of doubly fed inductuion
    2013-05-05 05:08:34下载
    积分:1
  • RTXWhitePaper-6-09
    Windows操作系统硬实时扩展软件RTX白皮书(Windows operating system RTX white paper)
    2012-01-07 23:12:25下载
    积分:1
  • C++tansuo
    C/C++深层探索,网上下载的都没有书签阅读度起来非常不方便,这是我整理后的加上了书签,看起来就方便多了.(C/C++ Deeper exploration, have not downloaded bookmark degrees is very inconvenient to read, this is finished I added a bookmark, looks much more convenient.)
    2009-01-08 13:50:01下载
    积分:1
  • OScode
    操作系统实验的代码以及说明包括各种经典的问题(Operating system code, as well as experiments that include a variety of classic problem)
    2009-06-21 10:33:54下载
    积分:1
  • docFilePrintTool
    文档打印控件,从分减少开发室文本操作,减少开发成本。利用减js、脚本进行开发的。可用性强(Printed document control, the text manipulation points reducing development room, reduce development costs. Using the reduction, js script for development. Usability is strong )
    2016-01-13 18:11:35下载
    积分:1
  • FileSplit
    简单的VB文件分割、合并工具,有需要的就下载吧。(Simple VB file split, merge tool, there is a need to download it.)
    2013-08-21 10:26:16下载
    积分:1
  • code
    在给定字符串中找出单词( “单词”由小写字母字符大写字母和构成,其他非字母字符视为单词的间隔, 如、问空格号、数字等等;另外单个字母不算单词);找到单词后,按照长度进行降序排序, (排序时如果长度相同,则按出现的顺序进行排列),然后输出到一个新的字符串中;如果某个单词重复出现多次, 则只输出一次;如果整个输入的字符串中没有找到单词,请输出空串。输出的单词之间使用一个“空格”隔开, 最后一个单词后不加空格。(Identify the word (" word" character from the uppercase and lowercase letters constituted, other non-alphabetic characters as word spacing, such as asking a space number, number, etc. another is not a single letter word) in a given string find words after descending order according to length, (if the same length, the order stated that appears when sorting arranged), and then output to a new string If a word is repeated several times, only output once If the entire input string is not found in word, outputs an empty string. Used between the output of a word " space" separated, no spaces after the last word.)
    2014-02-23 00:19:04下载
    积分:1
  • zoj1094
    zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )
    2012-06-10 10:38:53下载
    积分:1
  • system
    this is a word test!
    2009-12-24 15:52:18下载
    积分:1
  • 696518资源总数
  • 105159会员总数
  • 5今日下载