CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - double hashing
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - double hashing - List
[
Data structs
]
datrie_cvs20061001.tar
DL : 0
This an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.-This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
Date
: 2025-07-11
Size
: 34kb
User
:
lucoy
[
Windows Develop
]
234tree
DL : 0
2-3-4Trees and Red-Black Trees 2-3-4Trees and Red-Black Trees-2-3-4Trees and Red-Black Trees 2-3-4Trees and Red-Black Trees 2-3-4Trees and Red-Black Trees
Date
: 2025-07-11
Size
: 119kb
User
:
Ardy
[
Data structs
]
DoubleHashing
DL : 1
this codes is about double hashing
Date
: 2025-07-11
Size
: 1kb
User
:
shima
[
CA auth
]
JavaApplication1
DL : 0
The Hash Table. The way of hashing is Double hashing. It menas you use hash 2 times
Date
: 2025-07-11
Size
: 14kb
User
:
ain
[
Other
]
CS2208_DSLab_Programs
DL : 0
CS2208 - Data Structures Lab (Anna University) EXERCISES 1a. Implement singly linked lists. 1b. Implement doubly linked lists. 2. Represent a polynomial as a linked list and write functions for polynomial addition. 3. Implement stack and use it to convert infix to postfix expression 4. Implement a double-ended queue (dequeue) where insertion and deletion operations are possible at both the ends. 5. Implement an expression tree. Produce its pre-order, in-order, and postorder traversals. 6. Implement binary search tree. 7. Implement insertion in AVL trees. 8. Implement priority queue using binary heaps 9. Implement hashing with open addressing. 10. Implement Prim s algorithm using priority queues to find MST of an undirected graph.
Date
: 2025-07-11
Size
: 205kb
User
:
Narayana Swamy
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.