4.1.1 algae/algae.asd

Source

algae.asd.

Parent Component

algae (system).

ASDF Systems

algae.

---

4.1.2 algae/package.lisp

Source

algae.asd.

Parent Component

algae (system).

Packages

algae.

---

4.1.3 algae/data-structures/avl-tree.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.avl-tree.

Public Interface

• clear (function).
• copy (function).
• delete (function).
• find (function).
• insert (function).
• make-tree (function).
• node (structure).
• print-object (method).
• print-object (method).
• tree (structure).
• valid-p (function).
• walk (function).

Internals

• %make-node (function).
• %make-tree (function).
• delete-rebalance (function).
• insert-rebalance (function).
• make-node (function).
• min (function).
• node-balance-factor (reader).
• (setf node-balance-factor) (writer).
• node-data (reader).
• (setf node-data) (writer).
• node-height (reader).
• (setf node-height) (writer).
• node-key (reader).
• (setf node-key) (writer).
• node-left (reader).
• (setf node-left) (writer).
• node-p (function).
• node-parent (reader).
• (setf node-parent) (writer).
• node-right (reader).
• (setf node-right) (writer).
• node-tree (reader).
• (setf node-tree) (writer).
• rotate/left (function).
• rotate/left-right (function).
• rotate/right (function).
• rotate/right-left (function).
• transplant (function).
• tree-hash-test (reader).
• (setf tree-hash-test) (writer).
• tree-item-type (reader).
• (setf tree-item-type) (writer).
• tree-key (reader).
• (setf tree-key) (writer).
• tree-root (reader).
• (setf tree-root) (writer).
• tree-sentinel (reader).
• (setf tree-sentinel) (writer).
• tree-sorter (reader).
• (setf tree-sorter) (writer).

---

4.1.4 algae/data-structures/binary-search-tree.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.binary-search-tree.

Public Interface

• delete (function).
• find (function).
• insert (function).
• make-tree (function).
• max (function).
• min (function).
• next (function).
• node (structure).
• previous (function).
• print-object (method).
• print-object (method).
• tree (structure).
• valid-p (function).
• walk (function).

Internals

• %make-node (function).
• %make-tree (function).
• %walk/in-order (function).
• %walk/post-order (function).
• %walk/pre-order (function).
• make-node (function).
• node-data (reader).
• (setf node-data) (writer).
• node-key (reader).
• (setf node-key) (writer).
• node-left (reader).
• (setf node-left) (writer).
• node-p (function).
• node-parent (reader).
• (setf node-parent) (writer).
• node-right (reader).
• (setf node-right) (writer).
• node-tree (reader).
• (setf node-tree) (writer).
• transplant (function).
• tree-hash-test (reader).
• (setf tree-hash-test) (writer).
• tree-item-type (reader).
• (setf tree-item-type) (writer).
• tree-key (reader).
• (setf tree-key) (writer).
• tree-root (reader).
• (setf tree-root) (writer).
• tree-sentinel (reader).
• (setf tree-sentinel) (writer).
• tree-sorter (reader).
• (setf tree-sorter) (writer).

---

4.1.5 algae/data-structures/doubly-linked-list.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.doubly-linked-list.

Public Interface

• delete (function).
• find (function).
• head (reader).
• (setf head) (writer).
• insert (function).
• length (function).
• list (structure).
• list-values (function).
• make-list (function).
• next (reader).
• (setf next) (writer).
• node (structure).
• previous (reader).
• (setf previous) (writer).
• print-object (method).
• print-object (method).
• tail (reader).
• (setf tail) (writer).
• value (reader).
• (setf value) (writer).

Internals

• %length (reader).
• (setf %length) (writer).
• %make-list (function).
• make-node (function).
• node-p (function).

---

4.1.6 algae/data-structures/dynamic-array.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.dynamic-array.

Public Interface

• aref (function).
• (setf aref) (function).
• copy (function).
• dynamic-array (structure).
• find (function).
• length (function).
• make-array (function).
• map (function).
• pop (function).
• print-object (method).
• push (function).

Internals

• %make-array (function).
• data (reader).
• (setf data) (writer).
• fill-pointer (reader).
• (setf fill-pointer) (writer).
• initial-element (reader).
• (setf initial-element) (writer).

---

4.1.7 algae/data-structures/identifier-pool.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.identifier-pool.

Public Interface

• active-p (function).
• count (reader).
• (setf count) (writer).
• free (function).
• generate (function).
• id (function).
• make-pool (function).
• map (function).
• version (function).

Internals

• %make-pool (function).
• +id-bits+ (constant).
• +id-mask+ (constant).
• +version-bits+ (constant).
• +version-mask+ (constant).
• free-head (reader).
• (setf free-head) (writer).
• pack (function).
• pool (structure).
• store (reader).
• (setf store) (writer).
• unpack (function).

---

4.1.8 algae/data-structures/quad-tree.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.quad-tree.

Public Interface

• boundary (reader).
• (setf boundary) (writer).
• boundary (structure).
• insert (function).
• make-boundary (function).
• make-tree (function).
• print-object (method).
• query (function).
• tree (structure).

Internals

• %%make-tree (function).
• %insert (function).
• %make-tree (function).
• center (reader).
• (setf center) (writer).
• contains-point-p (function).
• depth (reader).
• (setf depth) (writer).
• extents (reader).
• (setf extents) (writer).
• intersects-p (function).
• max-capacity (reader).
• (setf max-capacity) (writer).
• max-depth (reader).
• (setf max-depth) (writer).
• ne (reader).
• (setf ne) (writer).
• nw (reader).
• (setf nw) (writer).
• points (reader).
• (setf points) (writer).
• se (reader).
• (setf se) (writer).
• sub-divide (function).
• sub-divided-p (function).
• sw (reader).
• (setf sw) (writer).

---

4.1.9 algae/data-structures/slot-map.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.slot-map.

Public Interface

• delete (function).
• find (function).
• insert (function).
• make-slot-map (function).
• map-keys (function).
• map-values (function).
• print-object (method).

Internals

• %make-slot-map (function).
• +id-bits+ (constant).
• +version-bits+ (constant).
• data (reader).
• (setf data) (writer).
• dequeue-free (function).
• enqueue-free (function).
• free-head (reader).
• (setf free-head) (writer).
• free-tail (reader).
• (setf free-tail) (writer).
• id (function).
• pack (function).
• repack-id (macro).
• reverse-map (reader).
• (setf reverse-map) (writer).
• slot-map (structure).
• slots (reader).
• (setf slots) (writer).
• unpack (function).
• version (function).

---

4.1.10 algae/data-structures/sparse-set.lisp

Source

algae.asd.

Parent Component

data-structures (module).

Packages

algae.sparse-set.

Public Interface

• clear (function).
• copy (function).
• delete (function).
• find (function).
• insert (function).
• length (function).
• make-sparse-set (function).
• map (function).
• print-object (method).

Internals

• %length (reader).
• (setf %length) (writer).
• %make-sparse-set (function).
• dense (reader).
• (setf dense) (writer).
• sparse (reader).
• (setf sparse) (writer).
• sparse-set (structure).

---

4.1.11 algae/tile-grid/tile-grid.lisp

Source

algae.asd.

Parent Component

tile-grid (module).

Packages

algae.tile-grid.

Public Interface

• add-properties (generic function).
• cell (structure).
• cell-contains-p (generic function).
• cell-empty-p (function).
• clear-properties (function).
• copy-grid (function).
• do-cells (macro).
• get-cell (function).
• grid (structure).
• height (reader).
• (setf height) (writer).
• make-grid (function).
• properties (reader).
• (setf properties) (writer).
• remove-properties (generic function).
• reset-grid (function).
• width (reader).
• (setf width) (writer).
• x (reader).
• (setf x) (writer).
• y (reader).
• (setf y) (writer).

Internals

• %make-grid (function).
• cells (reader).
• (setf cells) (writer).
• make-cell (function).

---

4.1.12 algae/convolution-kernel/convolution-kernel.lisp

Source

algae.asd.

Parent Component

convolution-kernel (module).

Packages

algae.convolution-kernel.

Public Interface

• add-properties (method).
• align (function).
• cell-contains-p (method).
• collect (function).
• convolve (function).
• count (function).
• detect (function).
• do-kernel (macro).
• find (function).
• flood-fill (function).
• make-kernel (function).
• map (function).
• origin (function).
• process (function).
• remove-properties (method).
• reshape (function).
• resolve (function).

Internals

• %make-kernel (function).
• %resolve (macro).
• *shapes* (special variable).
• default-mapper (macro).
• define-shape (macro).
• do/+ (macro).
• do/ellipse (macro).
• do/rect (macro).
• do/x (macro).
• grid (reader).
• (setf grid) (writer).
• kernel (structure).
• kernel-p (function).
• map/+ (function).
• map/ellipse (function).
• map/rect (function).
• map/x (function).
• mapper (reader).
• (setf mapper) (writer).
• max-x (reader).
• (setf max-x) (writer).
• max-y (reader).
• (setf max-y) (writer).
• min-x (reader).
• (setf min-x) (writer).
• min-y (reader).
• (setf min-y) (writer).
• register-shape (function).
• shape (reader).
• (setf shape) (writer).
• x (reader).
• (setf x) (writer).
• y (reader).
• (setf y) (writer).

---

4.1.13 algae/grid/package.lisp

Source

algae.asd.

Parent Component

grid (module).

Packages

algae.grid.

---

4.1.14 algae/grid/grid.lisp

Source

algae.asd.

Parent Component

grid (module).

Public Interface

initialize-instance (method).

Internals

• cell-origin (reader method).
• cell-p (function).
• cell-size (reader method).
• check-cell (function).
• corner-directions (reader method).
• distance (generic function).
• edge-directions (reader method).
• from-point (generic function).
• grid (class).
• make-grid (function).
• neighbor (function).
• neighbor-by-index (generic function).
• neighbor-directions (generic function).
• neighbor-offsets (generic function).
• neighbors (function).
• neighbors-p (function).
• nudge (generic function).
• select-line (generic function).
• select-range (generic function).
• size (reader method).
• to-point (generic function).

---

4.1.15 algae/grid/quad.lisp

Source

algae.asd.

Parent Component

grid (module).

Public Interface

initialize-instance (method).

Internals

• from-point (method).
• neighbor-by-index (method).
• nudge (method).
• quad-grid (class).
• select-line (method).
• select-range (method).
• to-point (method).

---

4.1.16 algae/grid/quad-4-way.lisp

Source

algae.asd.

Parent Component

grid (module).

Internals

• distance (method).
• neighbor-directions (method).
• neighbor-offsets (method).
• quad-grid/4-way (class).

---

4.1.17 algae/grid/quad-8-way.lisp

Source

algae.asd.

Parent Component

grid (module).

Internals

• distance (method).
• neighbor-directions (method).
• neighbor-offsets (method).
• quad-grid/8-way (class).

---

4.1.18 algae/grid/hex.lisp

Source

algae.asd.

Parent Component

grid (module).

Internals

• distance (method).
• forward (reader method).
• from-cell (generic function).
• from-point (method).
• hex-grid (class).
• hex-offset (function).
• hex-round (function).
• inverse (reader method).
• make-hex (function).
• neighbor-by-index (method).
• neighbor-offsets (method).
• nudge (method).
• offset (reader method).
• select-line (method).
• select-range (method).
• to-cell (generic function).
• to-point (method).

---

4.1.19 algae/grid/hex-rows.lisp

Source

algae.asd.

Parent Component

grid (module).

Public Interface

initialize-instance (method).

Internals

• from-cell (method).
• hex-grid/rows (class).
• neighbor-directions (method).
• to-cell (method).

---

4.1.20 algae/grid/hex-columns.lisp

Source

algae.asd.

Parent Component

grid (module).

Public Interface

initialize-instance (method).

Internals

• from-cell (method).
• hex-grid/columns (class).
• neighbor-directions (method).
• to-cell (method).

---

6.1.1 Macros

Macro: do-cells ((&key w h x1 y1 x2 y2) grid cell &body body) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Macro: do-kernel ((kernel cell) &body body) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

---

6.1.2 Ordinary functions

Function: active-p (pool identifier) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: align (kernel cell) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: aref (dynamic-array index) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: (setf aref) (dynamic-array index) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Reader: boundary (instance) ¶

Writer: (setf boundary) (instance) ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Target Slot

boundary.

Function: cell-empty-p (cell) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Function: clear (tree) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Function: clear (sparse-set) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: clear-properties (cell) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Function: collect (kernel test) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: convolve (kernel func &optional test) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: copy (dynamic-array) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: copy (tree &key key sort) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Function: copy (sparse-set) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: copy-grid (source target) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Reader: count (instance) ¶

Writer: (setf count) (instance) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Target Slot

count.

Function: count (kernel func) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: delete (slot-map key) ¶

Package

algae.slot-map.

Source

slot-map.lisp.

Function: delete (tree item) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: delete (list object &key key test from-end) ¶

Delete an object from the doubly linked list ‘LIST‘.

‘OBJECT‘ can be either a NODE object, or some value that is stored in the value of a NODE object. In the case of a non-NODE value, the list is searched linearly for a matching node before deletion occurs. Returns two values, the modified list, and a boolean specifying if a node was deleted.

‘KEY‘ specifies a function that is called with ‘OBJECT‘ as its only argument, if ‘OBJECT‘ is not of type node. It defaults to ‘#’IDENTITY‘. This argument has no effect if ‘OBJECT‘ is of type NODE.

‘TEST‘ specifies a function used to compare the value of ‘OBJECT‘ as it traverses nodes in the list. It defaults to ‘#’EQL‘. This argument has no effect if ‘OBJECT‘ is of type NODE.

Note: As specified above, this function traverses the list linearly for an object to delete if ‘OBJECT‘ is not a NODE.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Function: delete (tree item) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Function: delete (sparse-set value) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: detect (kernel func &optional count) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: find (dynamic-array item &key test key) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: find (slot-map key) ¶

Package

algae.slot-map.

Source

slot-map.lisp.

Function: find (tree item) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: find (list value &key start end key test from-end) ¶

Search for a node with the given ‘VALUE‘ in the doubly linked list ‘LIST‘.

‘START‘ and ‘END‘ are NODE objects to begin and end searching, inclusively.

‘KEY‘ specifies a function that is called with ‘VALUE‘ as its only argument. It defaults to ‘#’IDENTITY‘.

‘TEST‘ specifies a function used to compare the‘VALUE‘ as it traverses nodes in the list. It defaults to ‘#’EQL‘.

‘FROM-END‘, when specified, traverses the list in reverse, from tail to head.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Function: find (tree item) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Function: find (kernel test) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: find (sparse-set value) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: flood-fill (kernel cell test visited) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: free (pool identifier) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: generate (pool) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: get-cell (grid x y) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Reader: head (instance) ¶

Writer: (setf head) (instance) ¶

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Target Slot

head.

Reader: height (instance) ¶

Writer: (setf height) (instance) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Target Slot

height.

Function: id (identifier) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: insert (slot-map value) ¶

Package

algae.slot-map.

Source

slot-map.lisp.

Function: insert (tree item) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: insert (list value &key target where) ¶

Insert a new node into the doubly linked list ‘LIST‘, constructed to hold ‘VALUE‘.

‘TARGET‘ is an existing node to place the new node adjacent to. If ‘TARGET‘ is NIL, the head is implicitly targetted.

‘WHERE‘ can be either ‘:BEFORE‘ or ‘:AFTER‘, and specifies on which side of the target node to insert the new node. If unspecified, defaults to ‘:AFTER‘.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Function: insert (tree item) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Function: insert (tree point) ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Function: insert (sparse-set value) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: length (dynamic-array) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: length (list) ¶

Return the number of elements in the doubly linked list ‘LIST‘.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Function: length (sparse-set) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: list-values (list) ¶

Convert the doubly-linked list ‘LIST‘ into a Lisp list of its nodes’ values.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Function: make-array (&key size capacity element-type initial-element) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: make-boundary (center extents) ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Function: make-grid (width height) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Function: make-kernel (grid shape &key x y min-x max-x min-y max-y) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: make-list (&rest values) ¶

Create a new doubly linked list, optionally pre-populated with ‘VALUES‘.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Function: make-pool (&key capacity) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: make-slot-map (&key capacity initial-element data-type) ¶

Package

algae.slot-map.

Source

slot-map.lisp.

Function: make-sparse-set (&key size) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: make-tree (&key item-type key sort hash-test) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: make-tree (&key item-type key sort hash-test) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Function: make-tree (boundary &key max-depth max-capacity) ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Function: map (dynamic-array func) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: map (pool func) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: map (kernel func) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: map (sparse-set func) ¶

Package

algae.sparse-set.

Source

sparse-set.lisp.

Function: map-keys (slot-map func) ¶

Package

algae.slot-map.

Source

slot-map.lisp.

Function: map-values (slot-map func) ¶

Package

algae.slot-map.

Source

slot-map.lisp.

Function: max (node) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: min (node) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: next (node) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Reader: next (instance) ¶

Writer: (setf next) (instance) ¶

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Target Slot

next.

Function: origin (kernel) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: pop (dynamic-array &optional delete-p) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: previous (node) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Reader: previous (instance) ¶

Writer: (setf previous) (instance) ¶

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Target Slot

previous.

Function: process (kernel processor &key items test generator) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Reader: properties (instance) ¶

Writer: (setf properties) (instance) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Target Slot

properties.

Function: push (dynamic-array value) ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Function: query (tree boundary) ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Function: reset-grid (grid) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Function: reshape (kernel shape) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Function: resolve (kernel x y) ¶

Package

algae.convolution-kernel.

Source

convolution-kernel.lisp.

Reader: tail (instance) ¶

Writer: (setf tail) (instance) ¶

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Target Slot

tail.

Function: valid-p (tree) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: valid-p (tree) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Reader: value (instance) ¶

Writer: (setf value) (instance) ¶

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Target Slot

value.

Function: version (identifier) ¶

Package

algae.identifier-pool.

Source

identifier-pool.lisp.

Function: walk (tree func &key order) ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Function: walk (tree func) ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Reader: width (instance) ¶

Writer: (setf width) (instance) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Target Slot

width.

Reader: x (instance) ¶

Writer: (setf x) (instance) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Target Slot

x.

Reader: y (instance) ¶

Writer: (setf y) (instance) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Target Slot

y.

---

6.1.3 Generic functions

Generic Function: add-properties (cell type &rest properties) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Methods

Method: add-properties :around ((cell kernel) type &rest properties) ¶

Source

convolution-kernel.lisp.

Method: add-properties (cell type &rest properties) ¶

Generic Function: cell-contains-p (cell type property) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Methods

Method: cell-contains-p :around ((cell kernel) type property) ¶

Source

convolution-kernel.lisp.

Method: cell-contains-p (cell type property) ¶

Generic Function: remove-properties (cell type &rest properties) ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Methods

Method: remove-properties :around ((cell kernel) type &rest properties) ¶

Source

convolution-kernel.lisp.

Method: remove-properties (cell type &rest properties) ¶

---

6.1.4 Standalone methods

Method: initialize-instance :after ((instance quad-grid) &key) ¶

Source

quad.lisp.

Method: initialize-instance :after ((instance grid) &key size) ¶

Source

grid.lisp.

Method: initialize-instance :after ((instance hex-grid/rows) &key) ¶

Source

hex-rows.lisp.

Method: initialize-instance :after ((instance hex-grid/columns) &key) ¶

Source

hex-columns.lisp.

Method: print-object ((dynamic-array dynamic-array) stream) ¶

Source

dynamic-array.lisp.

Method: print-object ((slot-map slot-map) stream) ¶

Source

slot-map.lisp.

Method: print-object ((node node) stream) ¶

Source

binary-search-tree.lisp.

Method: print-object ((tree tree) stream) ¶

Source

binary-search-tree.lisp.

Method: print-object ((list list) stream) ¶

Source

doubly-linked-list.lisp.

Method: print-object ((node node) stream) ¶

Source

doubly-linked-list.lisp.

Method: print-object ((node node) stream) ¶

Source

avl-tree.lisp.

Method: print-object ((tree tree) stream) ¶

Source

avl-tree.lisp.

Method: print-object ((tree tree) stream) ¶

Source

quad-tree.lisp.

Method: print-object ((sparse-set sparse-set) stream) ¶

Source

sparse-set.lisp.

---

6.1.5 Structures

Structure: boundary ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: center ¶

Type

origin.vec2:vec

Initform

(origin.vec2:vec)

Readers

center.

Writers

(setf center).

Slot: extents ¶

Type

origin.vec2:vec

Initform

(origin.vec2:vec)

Readers

extents.

Writers

(setf extents).

Structure: cell ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: x ¶

Type

fixnum

Initform

0

Readers

x.

Writers

(setf x).

Slot: y ¶

Type

fixnum

Initform

0

Readers

y.

Writers

(setf y).

Slot: properties ¶

Type

hash-table

Initform

(golden-utils:dict (function eq))

Readers

properties.

Writers

(setf properties).

Structure: dynamic-array ¶

Package

algae.dynamic-array.

Source

dynamic-array.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: data ¶

Type

simple-vector

Initform

(make-array 0 :element-type t)

Readers

data.

Writers

(setf data).

Slot: initial-element ¶

Initform

0

Readers

initial-element.

Writers

(setf initial-element).

Slot: fill-pointer ¶

Type

fixnum

Initform

0

Readers

fill-pointer.

Writers

(setf fill-pointer).

Structure: grid ¶

Package

algae.tile-grid.

Source

tile-grid.lisp.

Direct superclasses

structure-object.

Direct slots

Slot: width ¶

Type

golden-utils:ub16

Initform

0

Readers

width.

Writers

(setf width).

Slot: height ¶

Type

golden-utils:ub16

Initform

0

Readers

height.

Writers

(setf height).

Slot: cells ¶

Type

(simple-array algae.tile-grid:cell (*))

Initform

(make-array 0 :element-type (quote algae.tile-grid:cell))

Readers

cells.

Writers

(setf cells).

Structure: list ¶

A doubly linked list that holds sequential nodes which have links to their previous and next node.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: head ¶

Readers

head.

Writers

(setf head).

Slot: tail ¶

Readers

tail.

Writers

(setf tail).

Slot: %length ¶

Type

fixnum

Initform

0

Readers

%length.

Writers

(setf %length).

Structure: node ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: tree ¶

Readers

node-tree.

Writers

(setf node-tree).

Slot: key ¶

Readers

node-key.

Writers

(setf node-key).

Slot: data ¶

Readers

node-data.

Writers

(setf node-data).

Slot: parent ¶

Readers

node-parent.

Writers

(setf node-parent).

Slot: left ¶

Readers

node-left.

Writers

(setf node-left).

Slot: right ¶

Readers

node-right.

Writers

(setf node-right).

Structure: node ¶

A doubly linked list node with references to its previous and next node.

Package

algae.doubly-linked-list.

Source

doubly-linked-list.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: value ¶

Readers

value.

Writers

(setf value).

Slot: previous ¶

Readers

previous.

Writers

(setf previous).

Slot: next ¶

Readers

next.

Writers

(setf next).

Structure: node ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: tree ¶

Readers

node-tree.

Writers

(setf node-tree).

Slot: key ¶

Readers

node-key.

Writers

(setf node-key).

Slot: data ¶

Readers

node-data.

Writers

(setf node-data).

Slot: parent ¶

Readers

node-parent.

Writers

(setf node-parent).

Slot: left ¶

Readers

node-left.

Writers

(setf node-left).

Slot: right ¶

Readers

node-right.

Writers

(setf node-right).

Slot: height ¶

Type

fixnum

Initform

0

Readers

node-height.

Writers

(setf node-height).

Slot: balance-factor ¶

Type

fixnum

Initform

0

Readers

node-balance-factor.

Writers

(setf node-balance-factor).

Structure: tree ¶

Package

algae.binary-search-tree.

Source

binary-search-tree.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: sentinel ¶

Readers

tree-sentinel.

Writers

(setf tree-sentinel).

Slot: root ¶

Readers

tree-root.

Writers

(setf tree-root).

Slot: item-type ¶

Readers

tree-item-type.

Writers

(setf tree-item-type).

Slot: key ¶

Type

function

Initform

(function identity)

Readers

tree-key.

Writers

(setf tree-key).

Slot: sorter ¶

Type

function

Initform

(function <)

Readers

tree-sorter.

Writers

(setf tree-sorter).

Slot: hash-test ¶

Type

function

Initform

(function eql)

Readers

tree-hash-test.

Writers

(setf tree-hash-test).

Structure: tree ¶

Package

algae.avl-tree.

Source

avl-tree.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: sentinel ¶

Readers

tree-sentinel.

Writers

(setf tree-sentinel).

Slot: root ¶

Readers

tree-root.

Writers

(setf tree-root).

Slot: item-type ¶

Readers

tree-item-type.

Writers

(setf tree-item-type).

Slot: key ¶

Type

function

Initform

(function identity)

Readers

tree-key.

Writers

(setf tree-key).

Slot: sorter ¶

Type

function

Initform

(function <)

Readers

tree-sorter.

Writers

(setf tree-sorter).

Slot: hash-test ¶

Type

function

Initform

(function eql)

Readers

tree-hash-test.

Writers

(setf tree-hash-test).

Structure: tree ¶

Package

algae.quad-tree.

Source

quad-tree.lisp.

Direct superclasses

structure-object.

Direct methods

print-object.

Direct slots

Slot: boundary ¶

Readers

boundary.

Writers

(setf boundary).

Slot: max-capacity ¶

Type

fixnum

Initform

0

Readers

max-capacity.

Writers

(setf max-capacity).

Slot: max-depth ¶

Type

fixnum

Initform

0

Readers

max-depth.

Writers

(setf max-depth).

Slot: depth ¶

Type

fixnum

Initform

0

Readers

depth.

Writers

(setf depth).

Slot: nw ¶

Readers

nw.

Writers

(setf nw).

Slot: ne ¶

Readers

ne.

Writers

(setf ne).

Slot: sw ¶

Readers

sw.

Writers

(setf sw).

Slot: se ¶

Readers

se.

Writers

(setf se).

Slot: points ¶

Readers

points.

Writers

(setf points).

---