https://github.com/strilanc/intervalreferences

Tracking nesting depth to allow efficient array slicing, with no memory leaks and logarithmic slicing costs.
https://github.com/strilanc/intervalreferences

Last synced: 12 months ago
JSON representation

Tracking nesting depth to allow efficient array slicing, with no memory leaks and logarithmic slicing costs.

• Host: GitHub
• URL: https://github.com/strilanc/intervalreferences
• Owner: Strilanc
• License: other
• Created: 2013-12-02T08:01:31.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2013-12-03T17:30:02.000Z (over 12 years ago)
• Last Synced: 2024-04-14T23:21:31.298Z (about 2 years ago)
• Language: C#
• Size: 113 KB
• Stars: 8
• Watchers: 4
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: License.txt

Awesome Lists containing this project

README

          
IntervalReferences

==================

An *interval reference* keeps a whole section of an array alive, while allowing the rest to be reclaimed if no other references cover it.

The code in this repository is an mockup of how interval references would work, algorithmically, based on using a balanced binary search tree to track nesting depth and detect holes.

An animation of the idea:

![Slicing Collection Animation](http://i.imgur.com/TJYnNPC.gif)