matchStartUsingWordTree_all - return all options [1018097]

< > BotCompany Repo | #1018097 // matchStartUsingWordTree_all - return all options

JavaX fragment (include)

// tok = CNC
// returns [(index, tree leaf)]
static LPair<Int, O> matchStartUsingWordTree_all(L<S> tok, Map<S, O> tree) {
  O best = null; // best leaf
  int bestIndex = 0; // best index
  
  int j = 1;
  LPair<Int, O> out = new L;
  while (j < l(tok)) {
    O def = tree.get("<default>");
    if (def != null) { best = def; bestIndex = j; }
   
    O t = tree.get(tok.get(j));
    j += 2;
    if (t == null) break;
    if (!t instanceof Map) break with addPair(out, j, t); // leaf!
    tree = (Map) t;
  }
  
  if (best != null) addPair(out, bestIndex, best);
  ret out;
}

Author comment

Began life as a copy of #1017908

Travelled to 13 computer(s): aoiabmzegqzx, bhatertpkbcr, cbybwowwnfue, cfunsshuasjs, gwrvuhgaqvyk, irmadwmeruwu, ishqpsrjomds, lpdgvwnxivlt, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt

Snippet ID:

#1018097

Snippet name:

matchStartUsingWordTree_all - return all options

Eternal ID of this version:

#1018097/3

Text MD5:

72c46ae4c6a91bf28afd579c9745903f

Author:

stefan

Category:

javax / a.i.

Type:

JavaX fragment (include)

Public (visible to everyone):

Yes

Archived (hidden from active list):

Created/modified:

2018-09-02 12:49:38

Source code size:

594 bytes / 22 lines

Pitched / IR pitched:

No / No

Views / Downloads:

292 / 357

Version history:

2 change(s)

Referenced in:

[show references]

1	// tok = CNC
2	// returns [(index, tree leaf)]
3	static LPair<Int, O> matchStartUsingWordTree_all(L<S> tok, Map<S, O> tree) {
4	O best = null; // best leaf
5	int bestIndex = 0; // best index
6
7	int j = 1;
8	LPair<Int, O> out = new L;
9	while (j < l(tok)) {
10	O def = tree.get("<default>");
11	if (def != null) { best = def; bestIndex = j; }
12
13	O t = tree.get(tok.get(j));
14	j += 2;
15	if (t == null) break;
16	if (!t instanceof Map) break with addPair(out, j, t); // leaf!
17	tree = (Map) t;
18	}
19
20	if (best != null) addPair(out, bestIndex, best);
21	ret out;
22	}