Types
BruteSpace = ref object list*: seq[Entry]
- Brute-force space just compares every entry vs every other entry. Supposed to be good for very small number or large ranges. Source Edit
HashSpace = ref object hash*: TableRef[(int32, int32), seq[Entry]] resolution*: float
- Divides space into little tiles that objects are hashed too. Supposed to be good for very uniform filled space. Source Edit
KdSpace = ref object root*: KdNode maxThings*: int
- KD-Tree, each cell is divided vertically or horizontally. Supposed to be good for large amount of entries. Source Edit
QuadNode = ref object things*: seq[Entry] nodes*: seq[QuadNode] bounds*: Rect level*: int
- Source Edit
Procs
proc clear(bs: BruteSpace) {.inline, ...raises: [], tags: [], forbids: [].}
- Clears the spaces and makes it ready to be used again. Source Edit
proc clear(hs: HashSpace) {.inline, ...raises: [], tags: [], forbids: [].}
- Clears the spaces and makes it ready to be used again. Source Edit
proc clear(ks: KdSpace) {.inline, ...raises: [], tags: [], forbids: [].}
- Clears the spaces and makes it ready to be used again. Source Edit
proc finalize(bs: BruteSpace) {.inline, ...raises: [], tags: [], forbids: [].}
- Finishes the space and makes it ready for use. Source Edit
proc finalize(hs: HashSpace) {.inline, ...raises: [], tags: [], forbids: [].}
- Finishes the space and makes it ready for use. Source Edit
proc finalize(ks: KdSpace) {....raises: [], tags: [], forbids: [].}
- Finishes the space and makes it ready for use. Source Edit
proc insert(bs: BruteSpace; e: Entry) {.inline, ...raises: [], tags: [], forbids: [].}
- Adds entry to the space. Source Edit
proc insert(hs: HashSpace; e: Entry) {....raises: [KeyError], tags: [], forbids: [].}
- Adds entry to the space. Source Edit
proc insert(ks: KdSpace; e: Entry) {.inline, ...raises: [], tags: [], forbids: [].}
- Adds entry to the space. Source Edit
proc insert(qs: QuadSpace; e: Entry) {....raises: [Exception], tags: [RootEffect], forbids: [].}
- Source Edit
proc len(bs: BruteSpace): int {.inline, ...raises: [], tags: [], forbids: [].}
- Number of entries inserted Source Edit
proc len(hs: HashSpace): int {.inline, ...raises: [], tags: [], forbids: [].}
- Number of entries inserted Source Edit
proc len(ks: KdSpace): int {....raises: [], tags: [], forbids: [].}
- Number of entries inserted. Source Edit
proc newBruteSpace(): BruteSpace {....raises: [], tags: [], forbids: [].}
- Creates a new brute-force space. Source Edit
proc newHashSpace(resolution: float): HashSpace {....raises: [], tags: [], forbids: [].}
- Creates a hash table space. Source Edit
proc newKdSpace(bounds: Rect; maxThings = 10; maxLevels = 10): KdSpace {. ...raises: [], tags: [], forbids: [].}
- Creates a new space based on kd-tree. Source Edit
proc newQuadSpace(bounds: Rect; maxThings = 10; maxLevels = 10): QuadSpace {. ...raises: [], tags: [], forbids: [].}
- Creates a new quad-tree space. Source Edit
proc newSortSpace(): SortSpace {....raises: [], tags: [], forbids: [].}
- Creates a new sorted space. Source Edit
Iterators
iterator all(bs: BruteSpace): Entry {....raises: [], tags: [], forbids: [].}
- Iterates all entries in a space. Source Edit
iterator all(hs: HashSpace): Entry {....raises: [], tags: [], forbids: [].}
- Iterates all entries in a space. Source Edit
iterator all(ks: KdSpace): Entry {....raises: [], tags: [], forbids: [].}
- Iterates all entries in a space. Source Edit
iterator findInRange(bs: BruteSpace; e: Entry; radius: float): Entry {. ...raises: [], tags: [], forbids: [].}
- Iterates all entries in range of an entry. Source Edit
iterator findInRange(hs: HashSpace; e: Entry; radius: float): Entry {. ...raises: [KeyError], tags: [], forbids: [].}
- Iterates all entries in range of an entry. Source Edit
iterator findInRange(ks: KdSpace; e: Entry; radius: float): Entry {....raises: [], tags: [], forbids: [].}
- Iterates all entries in range of an entry. Source Edit
iterator findInRangeApprox(bs: BruteSpace; e: Entry; radius: float): Entry {. ...raises: [], tags: [], forbids: [].}
- Iterates all entries in range of an entry but does not cull them. Useful if you need distance anyways and will compute other computations. Source Edit
iterator findInRangeApprox(hs: HashSpace; e: Entry; radius: float): Entry {. ...raises: [KeyError], tags: [], forbids: [].}
- Iterates all entries in range of an entry but does not cull them. Useful if you need distance anyways and will compute other computations. Source Edit
iterator findInRangeApprox(ks: KdSpace; e: Entry; radius: float): Entry {. ...raises: [], tags: [], forbids: [].}
- Iterates all entries in range of an entry but does not cull them. Useful if you need distance anyways and will compute other computations. Source Edit