24 #ifndef LINKEDLISTCUBE_H_INCLUDED 25 #define LINKEDLISTCUBE_H_INCLUDED 58 int alloc(
int N_x,
int N_y,
int N_z,
int max_num_nodes_in_pool);
62 int alloc_dual(
int N_x,
int N_y,
int N_z,
int max_num_nodes_in_pool);
65 int add_to_pool(T *t);
68 int add_to_pool_dual(T *t);
78 void clear_layer(
int l);
79 void clear_shadow_layer();
86 int add_node_to_stack(
int i,
int x,
int y,
int z);
87 int add_node_to_stack_shadow(
int i,
int x,
int y,
int z);
95 void get_dim(
int *Nx,
int *Ny,
int *Nz);
97 int safely_swap_layers();
99 void allow_swapping();
100 void forbid_swapping();
136 void pbc(
int *x,
int *y,
int *z);
140 #include "../src/LinkedListCube.tpp" T * obj
Definition: LinkedListCube.h:33
LinkedListNode< T > * pool2
Definition: LinkedListCube.h:122
LinkedListNode< T > ** root2
Definition: LinkedListCube.h:116
int shadow_layer
Definition: LinkedListCube.h:127
LinkedListNode * next
Definition: LinkedListCube.h:36
int num_nodes_in_pool
Definition: LinkedListCube.h:112
LinkedListNode< T > ** root1
Definition: LinkedListCube.h:115
int x
Definition: LinkedListCube.h:43
LinkedListNode< T > * pool_shadow
Definition: LinkedListCube.h:124
Definition: LinkedListCube.h:48
int N_z
Definition: LinkedListCube.h:106
LinkedListNode< T > * pool1
Definition: LinkedListCube.h:121
int z
Definition: LinkedListCube.h:43
int index
Definition: LinkedListCube.h:39
int max_num_nodes_in_pool
Definition: LinkedListCube.h:109
static const int i
index of ith thing
Definition: rod_math_v9.h:63
LinkedListNode< T > * pool
Definition: LinkedListCube.h:123
LinkedListNode< T > ** root
Definition: LinkedListCube.h:117
LinkedListNode< T > ** root_shadow
Definition: LinkedListCube.h:118
bool can_swap
Definition: LinkedListCube.h:130
int add_index
Definition: LinkedListCube.h:134
int y
Definition: LinkedListCube.h:43
int active_layer
Definition: LinkedListCube.h:126
Definition: LinkedListCube.h:31