| /webstack/php-experiment/php-5.2.9RC3/ext/xmlreader/examples/ |
| xmlreader_validatedtd.php | 9 /* Print node name indenting it based on depth and $indent var */
10 print str_repeat(" ", $xml->depth * $indent).$xml->name."\n";
13 print str_repeat(" ", $xml->depth * $indent)." Number of Attributes: ".$xml->attributeCount."\n";
|
| xmlreader_relaxNG.php | 12 /* Print node name indenting it based on depth and $indent var */
13 print str_repeat(" ", $reader->depth * $indent).$reader->name."\n";
|
| /webstack/webstack/branches/CoolStack12Rtm/src/php-5.2.4/ext/xmlreader/examples/ |
| xmlreader_validatedtd.php | 9 /* Print node name indenting it based on depth and $indent var */
10 print str_repeat(" ", $xml->depth * $indent).$xml->name."\n";
13 print str_repeat(" ", $xml->depth * $indent)." Number of Attributes: ".$xml->attributeCount."\n";
|
| xmlreader_relaxNG.php | 12 /* Print node name indenting it based on depth and $indent var */
13 print str_repeat(" ", $reader->depth * $indent).$reader->name."\n";
|
| /webstack/webstack/trunk/src/php-5.2.0/ext/xmlreader/examples/ |
| xmlreader_validatedtd.php | 9 /* Print node name indenting it based on depth and $indent var */
10 print str_repeat(" ", $xml->depth * $indent).$xml->name."\n";
13 print str_repeat(" ", $xml->depth * $indent)." Number of Attributes: ".$xml->attributeCount."\n";
|
| xmlreader_relaxNG.php | 12 /* Print node name indenting it based on depth and $indent var */
13 print str_repeat(" ", $reader->depth * $indent).$reader->name."\n";
|
| /webstack/webstack/trunk/src/php-5.2.4/ext/xmlreader/examples/ |
| xmlreader_validatedtd.php | 9 /* Print node name indenting it based on depth and $indent var */
10 print str_repeat(" ", $xml->depth * $indent).$xml->name."\n";
13 print str_repeat(" ", $xml->depth * $indent)." Number of Attributes: ".$xml->attributeCount."\n";
|
| xmlreader_relaxNG.php | 12 /* Print node name indenting it based on depth and $indent var */
13 print str_repeat(" ", $reader->depth * $indent).$reader->name."\n";
|
| /webstack/webstack/branches/CoolStack12Rtm/src/lighttpd-1.4.18/src/ |
| data_config.c | 54 static void data_config_print(const data_unset *d, int depth) {
66 array_print_indent(depth + 1);
69 depth ++;
77 array_print_indent(depth);
83 du->print(du, depth);
95 array_print_indent(depth);
96 du->print(du, depth);
102 depth --;
103 array_print_indent(depth);
112 array_print_indent(depth);
[all...] |
| /webstack/webstack/trunk/src/lighttpd-1.4.18/src/ |
| data_config.c | 54 static void data_config_print(const data_unset *d, int depth) {
66 array_print_indent(depth + 1);
69 depth ++;
77 array_print_indent(depth);
83 du->print(du, depth);
95 array_print_indent(depth);
96 du->print(du, depth);
102 depth --;
103 array_print_indent(depth);
112 array_print_indent(depth);
[all...] |
| /webstack/webstack/branches/CoolStack12Rtm/src/ruby-1.8.6/missing/ |
| alloca.c | 111 (b) keep track of stack depth.
127 char *deep; /* for stack depth measure */
146 auto char probe; /* probes stack depth: */
147 register char *depth = &probe; local
160 if (STACK_DIR > 0 && hp->h.deep > depth
161 || STACK_DIR < 0 && hp->h.deep < depth)
185 ((header *)new)->h.deep = depth;
|
| /webstack/webstack/trunk/src/ruby-1.8.5/missing/ |
| alloca.c | 111 (b) keep track of stack depth.
127 char *deep; /* for stack depth measure */
146 auto char probe; /* probes stack depth: */
147 register char *depth = &probe; local
160 if (STACK_DIR > 0 && hp->h.deep > depth
161 || STACK_DIR < 0 && hp->h.deep < depth)
185 ((header *)new)->h.deep = depth;
|
| /webstack/webstack/trunk/src/ruby-1.8.6/missing/ |
| alloca.c | 111 (b) keep track of stack depth.
127 char *deep; /* for stack depth measure */
146 auto char probe; /* probes stack depth: */
147 register char *depth = &probe; local
160 if (STACK_DIR > 0 && hp->h.deep > depth
161 || STACK_DIR < 0 && hp->h.deep < depth)
185 ((header *)new)->h.deep = depth;
|
| /webstack/webstack/branches/CoolStack12Rtm/src/ruby-1.8.6/lib/yaml/ |
| basenode.rb | 78 # YPath search returning a complete depth array
81 depth = 0
93 def match_segment( ypath, depth )
95 seg = ypath.segments[ depth ]
103 match_deep = v[1].match_segment( ypath, depth )
106 match_deep = v.match_segment( ypath, depth )
115 depth += 1
116 seg = ypath.segments[ depth ]
147 pred = ypath.predicates[ depth ]
161 return match_nodes + deep_nodes unless ypath.segments.length > depth +
[all...] |
| /webstack/webstack/trunk/src/ruby-1.8.5/lib/yaml/ |
| basenode.rb | 78 # YPath search returning a complete depth array
81 depth = 0
93 def match_segment( ypath, depth )
95 seg = ypath.segments[ depth ]
103 match_deep = v[1].match_segment( ypath, depth )
106 match_deep = v.match_segment( ypath, depth )
115 depth += 1
116 seg = ypath.segments[ depth ]
147 pred = ypath.predicates[ depth ]
161 return match_nodes + deep_nodes unless ypath.segments.length > depth +
[all...] |
| /webstack/webstack/trunk/src/ruby-1.8.6/lib/yaml/ |
| basenode.rb | 78 # YPath search returning a complete depth array
81 depth = 0
93 def match_segment( ypath, depth )
95 seg = ypath.segments[ depth ]
103 match_deep = v[1].match_segment( ypath, depth )
106 match_deep = v.match_segment( ypath, depth )
115 depth += 1
116 seg = ypath.segments[ depth ]
147 pred = ypath.predicates[ depth ]
161 return match_nodes + deep_nodes unless ypath.segments.length > depth +
[all...] |
| /webstack/webstack/branches/CoolStack12Rtm/src/openldap-2.3.30/libraries/liblutil/ |
| testavl.c | 42 static void ravl_print LDAP_P(( Avlnode *root, int depth ));
119 static void ravl_print( Avlnode *root, int depth )
126 ravl_print( root->avl_right, depth+1 );
128 for ( i = 0; i < depth; i++ )
132 ravl_print( root->avl_left, depth+1 );
|
| /webstack/webstack/trunk/src/openldap-2.3.30/libraries/liblutil/ |
| testavl.c | 42 static void ravl_print LDAP_P(( Avlnode *root, int depth ));
119 static void ravl_print( Avlnode *root, int depth )
126 ravl_print( root->avl_right, depth+1 );
128 for ( i = 0; i < depth; i++ )
132 ravl_print( root->avl_left, depth+1 );
|
| /webstack/webstack/branches/CoolStack12Rtm/src/ncurses-5.5/ncurses/base/ |
| resizeterm.c | 86 int depth = 0; local
94 depth = 1 + child_depth(tst);
99 return depth;
108 int depth = 0; local
113 ++depth;
117 return depth;
173 int depth = 0; local
180 TR(TRACE_UPDATE, ("decreasing size of windows to %dx%d, depth=%d",
181 ToLines, ToCols, depth));
186 if (child_depth(win) == depth) {
206 int depth = 0; local
[all...] |
| /webstack/webstack/trunk/src/ncurses-5.5/ncurses/base/ |
| resizeterm.c | 86 int depth = 0; local
94 depth = 1 + child_depth(tst);
99 return depth;
108 int depth = 0; local
113 ++depth;
117 return depth;
173 int depth = 0; local
180 TR(TRACE_UPDATE, ("decreasing size of windows to %dx%d, depth=%d",
181 ToLines, ToCols, depth));
186 if (child_depth(win) == depth) {
206 int depth = 0; local
[all...] |
| /webstack/webstack/branches/CoolStack12Rtm/src/gettext-0.16/gettext-tools/libgrep/ |
| kwset.c | 69 int depth; /* Depth of this node from the root. */ member in struct:trie
80 int mind; /* Minimum depth of an accepting node. */
81 int maxd; /* Maximum depth of any node. */
114 kwset->trie->depth = 0;
133 register int depth; local
154 depth = 1;
158 links[depth] = link;
160 dirs[depth++] = L, link = link->llink;
162 dirs[depth++] = R, link = link->rlink
[all...] |
| /webstack/webstack/trunk/src/gettext-0.16/gettext-tools/libgrep/ |
| kwset.c | 69 int depth; /* Depth of this node from the root. */ member in struct:trie
80 int mind; /* Minimum depth of an accepting node. */
81 int maxd; /* Maximum depth of any node. */
114 kwset->trie->depth = 0;
133 register int depth; local
154 depth = 1;
158 links[depth] = link;
160 dirs[depth++] = L, link = link->llink;
162 dirs[depth++] = R, link = link->rlink
[all...] |
| /webstack/webstack/branches/CoolStack12Rtm/src/squid-2.6.16/lib/ |
| splay.c | 129 splay_dump_entry(void *data, int depth)
131 printf("%*s%s\n", depth, "", (char *) data);
135 splay_do_dump(splayNode * top, void printfunc(void *data, int depth), int depth)
139 splay_do_dump(top->left, printfunc, depth + 1);
140 printfunc(top->data, depth);
141 splay_do_dump(top->right, printfunc, depth + 1);
145 splay_dump(splayNode * top, void printfunc(void *data, int depth))
|
| /webstack/webstack/trunk/src/squid/lib/ |
| splay.c | 129 splay_dump_entry(void *data, int depth)
131 printf("%*s%s\n", depth, "", (char *) data);
135 splay_do_dump(splayNode * top, void printfunc(void *data, int depth), int depth)
139 splay_do_dump(top->left, printfunc, depth + 1);
140 printfunc(top->data, depth);
141 splay_do_dump(top->right, printfunc, depth + 1);
145 splay_dump(splayNode * top, void printfunc(void *data, int depth))
|
| /webstack/webstack/trunk/src/squid-2.6.16/lib/ |
| splay.c | 129 splay_dump_entry(void *data, int depth)
131 printf("%*s%s\n", depth, "", (char *) data);
135 splay_do_dump(splayNode * top, void printfunc(void *data, int depth), int depth)
139 splay_do_dump(top->left, printfunc, depth + 1);
140 printfunc(top->data, depth);
141 splay_do_dump(top->right, printfunc, depth + 1);
145 splay_dump(splayNode * top, void printfunc(void *data, int depth))
|
