tagTRexNode::left - syntax, references, description

References

Code

Location

Referrer

int left;

arg_rex.c:353

n.next = n.right = n.left = -1;

arg_rex.c:381

trex_newnode()

exp->_nodes[n].left = classid;

arg_rex.c:434

trex_charclass()

exp->_nodes[node].left = *exp->_p;

arg_rex.c:482

trex_charnode()

exp->_nodes[r].left = exp->_nodes[first].type;

arg_rex.c:521

trex_class()

exp->_nodes[ret].left = exp->_nodes[ret].next;

arg_rex.c:545

trex_class()

exp->_nodes[expr].left = newn;

arg_rex.c:577

trex_element()

exp->_nodes[nnode].left = ret;

arg_rex.c:649

trex_element()

exp->_nodes[temp].left = ret;

arg_rex.c:679

trex_list()

if (c >= toupper(node->left) && c <= toupper(node->right))

arg_rex.c:730

trex_matchclass()

if (c >= tolower(node->left) && c <= tolower(node->right))

arg_rex.c:732

trex_matchclass()

if (c >= node->left && c <= node->right)

arg_rex.c:735

trex_matchclass()

if (trex_matchcclass(node->left, c))

arg_rex.c:740

trex_matchclass()

if ((s = trex_matchnode(exp, &exp->_nodes[node->left], s, greedystop)) == NULL)

arg_rex.c:773

trex_matchnode()

TRexNode* temp = &exp->_nodes[node->left];

arg_rex.c:813

trex_matchnode()

TRexNode* n = &exp->_nodes[node->left];

arg_rex.c:833

trex_matchnode()

return (node->left == 'b') ? str : NULL;

arg_rex.c:865

trex_matchnode()

return (node->left == 'b') ? NULL : str;

arg_rex.c:867

trex_matchnode()

if (trex_matchclass(exp, &exp->_nodes[node->left], *str) ? (type == OP_CLASS ? TRex_True : TRex_False)

arg_rex.c:882

trex_matchnode()

if (trex_matchcclass(node->left, *str)) {

arg_rex.c:889

trex_matchnode()

exp->_nodes[exp->_first].left = res;

arg_rex.c:923

trex_compile()

Call Tree

All items filtered out

Data Use

tagTRexNode::left is written by 7 functions and is read by 2 functions:

tagTRexNode::left

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

tagTRexNode::left field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle