coneneko.container



class Nodes;


Object link(Object a, Object b);


Object linkSerial(Object a, Object b, Object c, Object[] d...);
a-b-c-d ...

Object linkParallel(Object a, Object b, Object c, Object[] d...);
a-b, a-c, a-d, ...

Object[] nexts(Object a);


bool isTree(Object a);


void callTree(Object a, void delegate(Object obj, bool into) dg);


void remove(Object a);


void cut(Object a, Object b);


bool opIn_r(Object a);


void swap(Object a, Object b);


Object[] enumChain(Object a);
繋がっているものを

void removeChain(Object a);
繋がっているものを

void merge(Nodes nodes);


void clear();



Page generated by Ddoc.