Description: Tokyo Cabinet的Tokyo Cabinet 是一个DBM的实现。这里的数据库由一系列key-value对的记录构成。key和value都可以是任意长度的字节序列,既可以是二进制也可以是字符串。这里没有数据类型和数据表的概念。
作者叫Mikio Hirabayashi.Tokyo Cabinet是用C写的,同时提供c,perl,ruby,java的API。Tokyo Cabinet在提供了POSIX和C99的平台上都可用,它以GNU Lesser Public License协议发布。-Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array.Tokyo Cabinet is written in the C language, and provided as API of C, Perl, Ruby, Java, and Lua. Tokyo Cabinet is available on platforms which have API conforming to C99 and POSIX. Tokyo Cabinet is a free
software licensed under the GNU Lesser General Public License.
Platform: |
Size: 893952 |
Author:ws |
Hits:
Description: 自己上学编的Hashtable的java源码,里面可以选择所有的hash算法和防撞处理方式,带junit测试程序。-own java source of the Hashtable, which can choose all of the hash algorithm and anti-collision approach, with junit test procedure。 Platform: |
Size: 6144 |
Author:fang kun |
Hits:
Description: 这是 kyoko cabinet C 代码有关 Java 的绑定接口。
kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件,每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。
-Kyoto Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. Each key must be unique within a database. There is neither concept of data tables nor data types. Records are organized in hash table or B+ tree.
The following access methods are provided to the database: storing a record with a key and a value, deleting a record by a key, retrieving a record by a key. Moreover, traversal access to every key are provided. These access methods are similar to ones of the original DBM (and its followers: NDBM and GDBM) library defined in the UNIX standard. Kyoto Cabinet is an alternative for the DBM because of its higher performance.
Each operation of the hash database has the time complexity of "O(1)". Therefore, in theory, the performance is constant regardless of t Platform: |
Size: 105472 |
Author:Jim Abuma |
Hits:
Description: Tokyo cabinet C 库代码的Java绑定接口。
Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件,每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-The Tokyo Cabinet C libaray s Java binding.
Tokyo Cabinet is a library of routines for managing a database. The database is a simple data file containing records, each is a pair of a key and a value. Every key and value is serial bytes with variable length. Both binary data and character string can be used as a key and a value. There is neither concept of data tables nor data types. Records are organized in hash table, B+ tree, or fixed-length array. Platform: |
Size: 180224 |
Author:Jim Abuma |
Hits:
Description: 《Java数据结构和算法》(第2版)介绍了计算机编程中使用的数据结构和算法,对于在计算机应用中如何操作和管理数据以取得最优性能提供了深入浅出的讲解。全书共分为15章,分别讲述了基本概念、数组、简单排序、堆和队列、链表、递归、进阶排序、二叉树、红黑树、哈希表及图形等知识。-" Java data structures and algorithms" (2) describes computer programming, data structures and algorithms for applications in the computer how to operate and manage data to achieve optimal performance provides simple terms. The book is divided into 15 chapters, describes the basic concepts, arrays, simple sort, heap and queue, linked lists, recursion, advanced sort, binary tree, red-black tree, hash table and graphics knowledge. Platform: |
Size: 10085376 |
Author:张久刚 |
Hits:
Description: 100个用Java编写的简单程序,适合Java初学者学习。还包括哈希表操作,矢量操作,数组数据操作的讲述。-100 with a simple program written in Java, it is suitable for Java beginners to learn.Also includes the hash table operations, vector operations, the array of data about the operation.
Platform: |
Size: 12837888 |
Author:wayr |
Hits:
Description: 个人原创代码:编写Java Application程序,用散列表实现学生成绩单的存储和查询,并将若干个查询结果存放到一个向量中,通过循环将向量对象内容逐个输出。-The original code of the individual: Java Application program to write, store and query the hash table to achieve the students transcripts, and the number of query results stored in a vector loop one by one output vector object content. Platform: |
Size: 2048 |
Author:李瑞 |
Hits:
Description: 介绍Java 的实用工具类库java.util 包。在这个包中,Java 提供了一些实用的
方法和数据结构。例如,Java 提供日期(Data)类、日历(Calendar)类来产生和获取
日期及时间,提供随机数(Random)类产生各种类型的随机数,还提供了堆栈
(Stack)、向量(Vector) 、位集合(Bitset)以及哈希表(Hashtable)等类来表示相应的
数据结构.-Introduction of Java Utility library java.util package. In this package, Java provides some practical
Methods and data structures. For example, Java provides the date (Data) class calendar (Calendar) class to generate and access
Date and time, providing a random number (Random) class produces various types of random numbers, but also provides the stack
(Stack), vector (Vector), bit set (Bitset) and hash table (Hashtable) and other classes to represent the corresponding Data Structures. Platform: |
Size: 250880 |
Author:peter |
Hits:
Description: 讲述了基本概念、数组、简单排序、堆和队列、链表、递归、进阶排序、二叉树、红黑树、哈希表及图形等知识。附录中则提供了运行专题Applet和例程、相关书籍和问题解答。《Java数据结构和算法》(第2版)提供了学完一门编程语言后进一步需要知道的知识。本书所涵盖的内容通常作为大学或学院中计算机系二年级的课程-t tells you the basics, arrays, simple sorting, heap and queue, linked list, recursion, advanced sorting, binary tree, red-black tree, hash table and graphics. Appendices are provided to run thematic applets and routines, related books and questions and answers. The Java Data Structures and Algorithms (2nd Edition) provides additional knowledge that you need to know when you are finished with a programming language. The content covered in this book is usually the second year of the Department of Computer Science at the University or College
Platform: |
Size: 25161728 |
Author:王懿 |
Hits: