JarCasting
JarCasting JarCasting

trie-search-js

WebJar for trie-search-js

License

License
Categories

Categories

JavaScript Languages Search Business Logic Libraries
GroupId

GroupId

org.webjars.npm
ArtifactId

ArtifactId

trie-search-js
Last Version

Last Version

0.0.1
Release Date

Release Date
Type

Type

jar
Description

Description

trie-search-js
WebJar for trie-search-js
Project URL

Project URL

http://webjars.org
Source Code Management

Source Code Management

https://github.com/mikedeboer/trie

Download trie-search-js

Filename Size
trie-search-js-0.0.1.pom
trie-search-js-0.0.1.jar 279 KB
trie-search-js-0.0.1-sources.jar 22 bytes
trie-search-js-0.0.1-javadoc.jar 22 bytes
Browse

How to add to project

<!-- https://jarcasting.com/artifacts/org.webjars.npm/trie-search-js/ -->
<dependency>
    <groupId>org.webjars.npm</groupId>
    <artifactId>trie-search-js</artifactId>
    <version>0.0.1</version>
</dependency>
// https://jarcasting.com/artifacts/org.webjars.npm/trie-search-js/
implementation 'org.webjars.npm:trie-search-js:0.0.1'
// https://jarcasting.com/artifacts/org.webjars.npm/trie-search-js/
implementation ("org.webjars.npm:trie-search-js:0.0.1")
'org.webjars.npm:trie-search-js:jar:0.0.1'
<dependency org="org.webjars.npm" name="trie-search-js" rev="0.0.1">
  <artifact name="trie-search-js" type="jar" />
</dependency>
@Grapes(
@Grab(group='org.webjars.npm', module='trie-search-js', version='0.0.1')
)
libraryDependencies += "org.webjars.npm" % "trie-search-js" % "0.0.1"
[org.webjars.npm/trie-search-js "0.0.1"]

Dependencies

There are no dependencies for this project. It is a standalone project that does not depend on any other jars.

Project Modules

There are no modules declared in this project.

Trie.js

My take on an efficient implementation of a Trie in Javascript

Short story

A Trie is a kind of digital search tree. (See [Knuth1972] for more details on digital search trees.)

[Fredkin1960] introduced the trie terminology, which is abbreviated from "Retrieval".

[Knuth1972] Knuth, D. E. The Art of Computer Programming Vol. 3, Sorting and Searching. Addison-Wesley. 1972.

[Fredkin1960] Fredkin, E. Trie Memory. Communication of the ACM. Vol. 3:9 (Sep 1960). pp. 490-499.

(source)

The trie implementation of Dennis Byrne served as a starting point and inspiration.

For more information, please take a look at the Wikipedia article

Usage

Please take a look at the file

  test/test.html

which pretty much explains the things you can do with Trie.js in code. The test.html file uses a pure JS dataset of 44.830 records, which you can find in

  data/people_44830.js

More information and full documentation of the API can be found in

  docs/index.html

Or read them online at https://mikedeboer.github.io/trie/.

License

MIT.

Amsterdam, 2010. Mike de Boer.

Versions

Version
0.0.1