| /lucene-3.6.0/lucene/contrib/spellchecker/src/java/org/apache/lucene/search/suggest/tst/ |
| H A D | TSTAutocomplete.java | 42 root = insert(root, (String) tokens[mid], vals[mid], 0);
60 public TernaryTreeNode insert(TernaryTreeNode currentNode, CharSequence s, method in class:TSTAutocomplete
70 currentNode.eqKid = insert(currentNode.eqKid, s, val, x + 1);
77 currentNode.loKid = insert(currentNode.loKid, s, val, x);
80 currentNode.eqKid = insert(currentNode.eqKid, s, val, x + 1);
87 currentNode.hiKid = insert(currentNode.hiKid, s, val, x);
|
| /lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/ |
| H A D | ScorerDocQueue.java | 81 public boolean insert(Scorer scorer){ method in class:ScorerDocQueue
|
| /lucene-3.6.0/solr/solrj/src/java/org/apache/solr/client/solrj/response/ |
| H A D | FacetField.java | 136 public void insert( String name, long cnt ) method in class:FacetField
|
| /lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/tartarus/snowball/ |
| H A D | SnowballProgram.java | 46 * eq_s,eq_s_b,insert,replace_s take CharSequence like eq_v and eq_v_b
447 // insert the replacement text
506 protected void insert(int c_bra, int c_ket, CharSequence s) method in class:SnowballProgram
515 protected void insert(int c_bra, int c_ket, String s) method in class:SnowballProgram
517 insert(c_bra, c_ket, (CharSequence)s);
522 protected void insert(int c_bra, int c_ket, StringBuilder s) method in class:SnowballProgram
524 insert(c_bra, c_ket, (CharSequence)s);
|
| /lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/compound/hyphenation/ |
| H A D | TernaryTree.java | 142 public void insert(String key, char val) { method in class:TernaryTree
151 root = insert(root, strkey, 0, val);
154 public void insert(char[] key, int start, char val) { method in class:TernaryTree
159 root = insert(root, key, start, val);
165 private char insert(char p, char[] key, int start, char val) { method in class:TernaryTree
220 lo[p] = insert(lo[p], key, start, val);
223 eq[p] = insert(eq[p], key, start + 1, val);
229 hi[p] = insert(hi[p], key, start, val);
367 * Recursively insert the median first and then the median of the lower and
378 insert(
[all...] |