Changes

Jump to navigation Jump to search
Line 129: Line 129:  
#* Be aware that block can overlap. So the Nth entry can finish before the previous N-1th entry.
 
#* Be aware that block can overlap. So the Nth entry can finish before the previous N-1th entry.
 
# Lookups are implemented as a binary search. Easy to implement due to the 2 previous properties.
 
# Lookups are implemented as a binary search. Easy to implement due to the 2 previous properties.
 +
 +
* '''<code>C++ class: BaseBlockArray</code>'''
 +
* '''<code>C++ class: BaseBlocks</code>'''
 +
* '''<code>C++ object: static BaseBlocks recBlocks</code>'''
 +
    
=== Block Link ===
 
=== Block Link ===
ninja
56

edits

Navigation menu