ARB_SELFIDX
ARB_SELFIDX(ctd32tree, ctd32) :
ARB_SELFIDX(ctd64tree, ctd64));
ARB_SELFIDX(ctd32tree, ctd32) + 1) :
ARB_SELFIDX(ctd64tree, ctd64) + 1) :
ARB_FREEIDX(ctd32tree) == ARB_SELFIDX(ctd32tree, ctd32) :
ARB_FREEIDX(ctd64tree) == ARB_SELFIDX(ctd64tree, ctd64)),
ARB_SELFIDX(ctd64tree, RB_LEFT(rbctd64, rblnk))
ARB_SELFIDX(ctd64tree, RB_RIGHT(rbctd64, rblnk))
ARB_SELFIDX(ctd64tree,
(int)ARB_SELFIDX(ctd64tree, ctd64),
(int)ARB_SELFIDX(ctd64tree, rbctd64),
(int)ARB_SELFIDX(ctd64tree,
(int)ARB_SELFIDX(ctd64tree,
(int)ARB_SELFIDX(ctd64tree,
parent ? ARB_SELFIDX(head, parent) : ARB_NULLIDX; \
ARB_SELFIDX(head, elm); \
if (ARB_SELFIDX(head, elm) == \
ARB_LEFTIDX(tmp, field) = ARB_SELFIDX(head, elm); \
ARB_SELFIDX(head, elm); \
if (ARB_SELFIDX(head, elm) == \
ARB_RIGHTIDX(tmp, field) = ARB_SELFIDX(head, elm); \
ARB_FREEIDX(head) = ARB_SELFIDX(head, elm); \
ARB_SELFIDX(head, parent); \
ARB_SELFIDX(head, child); \
ARB_SELFIDX(head, child); \
ARB_ROOTIDX(head) = ARB_SELFIDX(head, child); \
field) = ARB_SELFIDX(head, elm); \
field) = ARB_SELFIDX(head, elm); \
ARB_ROOTIDX(head) = ARB_SELFIDX(head, elm); \
ARB_SELFIDX(head, elm); \
field) = ARB_SELFIDX(head, elm); \
ARB_PARENTIDX(child, field) = ARB_SELFIDX(head, parent);\
ARB_SELFIDX(head, child); \
ARB_SELFIDX(head, child); \
ARB_ROOTIDX(head) = ARB_SELFIDX(head, child); \
if (ARB_MINIDX(head) == ARB_SELFIDX(head, old)) \
if (ARB_MAXIDX(head) == ARB_SELFIDX(head, old)) \
ARB_SELFIDX(head, elm); \
ARB_SELFIDX(head, elm); \
ARB_ROOTIDX(head) = ARB_SELFIDX(head, elm); \
ARB_LEFTIDX(parent, field) == ARB_SELFIDX(head, elm))) \
ARB_MINIDX(head) = ARB_SELFIDX(head, elm); \
ARB_RIGHTIDX(parent, field) == ARB_SELFIDX(head, elm))) \
ARB_MAXIDX(head) = ARB_SELFIDX(head, elm); \
ARB_SELFIDX(head, x) < ARB_MAXNODES(head); \