Libraryless. Click here for Pure Java version (3129L/20K).
1 | svoid test_CompactTreeSet() { |
2 | LS list = repF(1000, () -> randomID(3)); |
3 | Set<S> set = asTreeSet(list); |
4 | CompactTreeSet<S> cset = new(set); |
5 | print(set); |
6 | print(cset); |
7 | assertEquals(asList(set), asList(cset)); |
8 | assertEqualsVerbose(l(set), l(cset)); |
9 | |
10 | for (S a : shuffledIterator(list)) { |
11 | set.remove(a); |
12 | cset.remove(a); |
13 | assertEquals(asList(set), asList(cset)); |
14 | assertEqualsVerbose(l(set), l(cset)); |
15 | } |
16 | } |
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: | #1029167 |
Snippet name: | test_CompactTreeSet [OK] |
Eternal ID of this version: | #1029167/1 |
Text MD5: | a9f41dbc4797f8b3cb86872503054bf7 |
Transpilation MD5: | 305765092484e49ea1fa16bc729eaadd |
Author: | stefan |
Category: | javax |
Type: | JavaX fragment (include) |
Public (visible to everyone): | Yes |
Archived (hidden from active list): | No |
Created/modified: | 2020-07-23 15:04:26 |
Source code size: | 442 bytes / 16 lines |
Pitched / IR pitched: | No / No |
Views / Downloads: | 217 / 307 |
Referenced in: | [show references] |