Libraryless. Click here for Pure Java version (4771L/27K).
// optimized for search - O(1) for searching for a certain element // set is O(log m) with m = number of occurrences of element final sclass ContentsIndexedList<A> extends RandomAccessAbstractList<A> implements IContentsIndexedList<A>, IContentsIndexedList2<A> { new Map<A, TreeSet<Elem<A>>> index; // tokens by contents, sorted by index final new ArrayList<Elem<A>> list; final sclass Elem<A> extends HasIndex { A s; // actual token toString { ret "Elem " + quote(s) + "@" + idx; } } *() {} *(Map<A, TreeSet<Elem<A>>> *index) {} // use different type of index (e.g. ciMap) *(Cl<A> l) { addAll(l); } public A get(int i) { ret list.get(i).s; } public int size() { ret list.size(); } public A set(int i, A s) { Elem<A> t = list.get(i); A old = t.s; if (eq(old, s)) ret old; removeFromIdx(t); t.s = s; addToIdx(t); ret old; } public bool add(A s) { ++modCount; new Elem<A> t; t.s = s; t.idx = size(); list.add(t); addToIdx(t); true; } public void add(int i, A s) { ++modCount; new Elem<A> t; t.s = s; t.idx = i; list.add(i, t); reorder(i+1); addToIdx(t); } public bool addAll(int i, Collection<? extends A> l) { int n = l.size(); if (n == 0) false; ++modCount; L<Elem<A>> l2 = emptyList(n); int j = i; for (A s : l) { new Elem<A> t; t.s = s; t.idx = j++; l2.add(t); } list.addAll(i, l2); reorder(i+n); for (Elem<A> t : l2) addToIdx(t); true; } public A remove(int i) { ++modCount; Elem<A> t = list.get(i); removeFromIdx(t); list.remove(i); reorder(i); ret t.s; } void reorder(int fromIdx) { int n = size(); for (int i = fromIdx; i < n; i++) list.get(i).idx = i; } void removeFromIdx(Elem<A> t) { TreeSet<Elem<A>> idx = index.get(t.s); idx.remove(t); if (idx.isEmpty()) index.remove(t.s); } void addToIdx(Elem<A> t) { TreeSet<Elem<A>> idx = index.get(t.s); if (idx == null) index.put(t.s, idx = new TreeSet); idx.add(t); } @Override public int indexOf(O s) { TreeSet<Elem<A>> l = index.get(s); ret l == null ? -1 : first(l).idx; } @Override public int lastIndexOf(O s) { TreeSet<Elem<A>> l = index.get(s); ret l == null ? -1 : last(l).idx; } @Override public bool contains(O s) { ret index.containsKey(s); } public void clear() { ++modCount; index.clear(); list.clear(); } protected void removeRange(int fromIndex, int toIndex) { if (fromIndex == toIndex) ret; ++modCount; for (int i = fromIndex; i < toIndex; i++) removeFromIdx(list.get(i)); list.subList(fromIndex, toIndex).clear(); reorder(fromIndex); } public int[] indicesOf(A o) { TreeSet<Elem<A>> idx = index.get(o); if (idx == null) ret emptyIntArray(); int[] a = new int[idx.size()]; int i = 0; for (Elem<A> t : idx) a[i++] = t.idx; ret a; } public TreeSet<HasIndex> indicesOf_treeSetOfHasIndex(A o) { ret (TreeSet) index.get(o); } }
Began life as a copy of #1025510
download show line numbers debug dex old transpilations
Travelled to 7 computer(s): bhatertpkbcr, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt, xrpafgyirdlv
No comments. add comment
Snippet ID: | #1028238 |
Snippet name: | ContentsIndexedList - ArrayList with instant lookup by element |
Eternal ID of this version: | #1028238/11 |
Text MD5: | fe4abc675232f300c5068205e659b874 |
Transpilation MD5: | 1def625adb721684722873a0d25c4f07 |
Author: | stefan |
Category: | javax |
Type: | JavaX fragment (include) |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2022-01-15 01:46:29 |
Source code size: | 3303 bytes / 143 lines |
Pitched / IR pitched: | No / No |
Views / Downloads: | 307 / 680 |
Version history: | 10 change(s) |
Referenced in: | #1033968 - CalculatedFieldIndexedList [dev.] - ArrayList with instant lookup by element after applying a transformation function #1034167 - Standard Classes + Interfaces (LIVE, continuation of #1003674) |