-
- expose whats happening inside the pipeline in the wiki UI (data flow etc), in a minimal, overlaid visualization
- instrumenting processes run by Datscript to enable finite control and amortized real…
-
A new section in Chapter 8 should be added about persistent arrays, which are now covered in lecture.
-
_Installation details_
Scylla version (or git commit hash): 89375d4c2afe366e18fed2010acdc52a6c8a28fb
lsa currently uses bump-the-pointer allocation. But it could also maintain a free list, and try al…
-
Error reported in course FIT5211 on page Lists by user lwoo0004 lindy.woodburn@gmail.com
Incorrect info on page ... pop(i) is O(k) not O(n).
e.g. popping from an indexed location from the end of a li…
-
Probably doesn't matter most of the time, but arrays are poorly suited as a queue. `shift()` is an O(n) operation. Better would be a simple structure which has amortized O(1) operations:
```js
c…
-
-
-
I have taken a look at your project roughly and found something weird. The Data.Heap.Binary you implemented did not seem to be the `Binary heap' I learned from books. Its`merge' operation looked simil…
-
We should implement a vector class, using std:vector from C++, which would allow adding new items to a vector with amortized constant complexity (it would solve a "dynamically extending vector" proble…
-
Hello!
Thank you for this wonderful piece of code. =)
Have you tried tuning the performance?
E.g. for 10,000 random matches (each of max. 5 teams of max. 10 members each) it consistently take…