KO
|
EN
gitlite — search
Search
#typescript
#ai-agents
#ai
#dsh-plugin
#deepseek-harness
#open-source
#cli
#claude-code
#codex
#developer-tools
#react
#windows
jsT9
★ 63
Open GitHub ↗
A text-prediction JavaScript tool
Download README (.md)
Explore Similar Repositories
MobileDevice
:
iTunesMobileDevice C# API
ember-todo
:
a example of rails4 ember 1.0 ember-data 1.0.0beta2
HJNSObjectReleaseDemo
:
No description available.
gocostmodel
:
Benchmarks of common basic operations for the Go language.
xml2obj-stream
:
XML to JavaScript object low memory streaming parser based on node-expat
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
jsT9
?
Download (.md)
# jsT9 [](https://travis-ci.org/talyssonoc/jsT9) [](https://codeclimate.com/github/talyssonoc/jsT9) ## Installation With npm ``` $ npm install jst9 --save ``` With Bower ``` $ bower install jst9 --save ``` Or copy some of the files inside `dist` folder. On browsers, it exports the `jsT9` global. ## Usage To create a new jsT9 instance, you show use the constructor like this: ``` var tree = new jsT9(words[, settings]); ``` Where: - `words` can be: - An array of words, or - A string with the path of a JSON file with a field called 'words' containing the array of words (see the words.json example file). See `ready` method on the API below. - `settings` (optional) - `sort`: A `sort(A, B)` (__Default__: Alphabetical order) function that returns: - -1 if `A < B` - 1 if `A > B` - 0 if `A == B` - `maxAmount`: Default max amount of predictions to be returned (__Default__: `Infinity`). - `slackSearch`: Search words using [slack search](#how-slack-search-works) (__Default__: `true`). ## API - `predict(word)`: Return the predictions to the given word. - `addWord(word)`: Add an new word to the tree. - `ready(callback)`: Runs the callback when the tree is ready, useful when you're loading the words with JSON. ## How slack search works If no complete word in the tree matches the searched word, the slack search will remove the last character of the word, one by one, until it finds a match. Example: Given this word list: - List - Look - Loop If you try predict `Loo`, you'll get `["Look", "Loop"]`. But if you try predict `Lx`, the algorithm won't find a match, so it will remove the "x" and try to predict `L`, then you'll get `["List", "Look", "Loop"]`.
