Timeline for Fast check of content in a node or descendants in a tree
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 12 at 17:48 | comment | added | gruszczy | The intersection of nodes is not empty. | |
| Oct 12 at 17:48 | comment | added | gruszczy | There are no restrictions on the sets. Use of letters might be seem there is some ordering on them, but there isn't. | |
| Oct 12 at 16:03 | answer | added | Cătălin Frâncu | timeline score: 1 | |
| Oct 12 at 7:10 | answer | added | gnasher729 | timeline score: 0 | |
| Oct 12 at 7:07 | comment | added | gnasher729 | How does your idea work for a million items? | |
| Oct 11 at 19:39 | answer | added | TilmannZ | timeline score: 0 | |
| Oct 11 at 7:48 | comment | added | D.W.♦ | Are there some conditions/limits/relationships on the sets stored in the nodes? like that there is some ordering? (e.g., all elements under a left child are less than all elements under a right child?) | |
| Oct 11 at 6:31 | comment | added | greybeard | (State all operations to be supported.) | |
| Oct 11 at 6:25 | comment | added | greybeard | Is the intersection of "the original sets" always empty? | |
| S Oct 10 at 20:34 | review | First questions | |||
| Oct 12 at 7:10 | |||||
| S Oct 10 at 20:34 | history | asked | gruszczy | CC BY-SA 4.0 |