Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::CA::ca_hashlife_detail::Node Struct Reference

Canonical quadtree node. More...

#include <tpl_ca_hashlife.H>

Collaboration diagram for Aleph::CA::ca_hashlife_detail::Node:
[legend]

Public Attributes

std::uint8_t level
 1 ⇒ 2x2 leaf; k ⇒ 2^k × 2^k node
 
std::uint8_t bits
 for level-1 leaves: NW NE SW SE bits
 
std::uint64_t population
 number of alive cells covered by this node
 
Node * nw
 
Node * ne
 
Node * sw
 
Node * se
 
Node * result
 memoised next-generation result (level level - 1)
 

Detailed Description

Canonical quadtree node.

Nodes are interned: two nodes with identical children (or identical bits, for level-1 leaves) are the same Node *.

Definition at line 215 of file tpl_ca_hashlife.H.

Member Data Documentation

◆ bits

std::uint8_t Aleph::CA::ca_hashlife_detail::Node::bits

◆ level

◆ ne

◆ nw

◆ population

std::uint64_t Aleph::CA::ca_hashlife_detail::Node::population

◆ result

Node* Aleph::CA::ca_hashlife_detail::Node::result

memoised next-generation result (level level - 1)

Definition at line 224 of file tpl_ca_hashlife.H.

Referenced by Aleph::CA::Hashlife_Engine::evolve().

◆ se

◆ sw


The documentation for this struct was generated from the following file: