/macosx-10.9.5/WebCore-7537.78.1/dom/ |
H A D | NodeTraversal.cpp | 35 Node* previousIncludingPseudo(const Node* current, const Node* stayWithin) argument 38 if (current == stayWithin) 40 if ((previous = current->pseudoAwarePreviousSibling())) { 45 return current->parentNode(); 48 Node* nextIncludingPseudo(const Node* current, const Node* stayWithin) argument 51 if ((next = current->pseudoAwareFirstChild())) 53 if (current == stayWithin) 55 if ((next = current->pseudoAwareNextSibling())) 57 for (current = current 66 nextIncludingPseudoSkippingChildren(const Node* current, const Node* stayWithin) argument 82 nextAncestorSibling(const Node* current) argument 92 nextAncestorSibling(const Node* current, const Node* stayWithin) argument 105 previous(const Node* current, const Node* stayWithin) argument 118 previousSkippingChildren(const Node* current, const Node* stayWithin) argument 133 nextPostOrder(const Node* current, const Node* stayWithin) argument 145 previousAncestorSiblingPostOrder(const Node* current, const Node* stayWithin) argument 157 previousPostOrder(const Node* current, const Node* stayWithin) argument 168 previousSkippingChildrenPostOrder(const Node* current, const Node* stayWithin) argument [all...] |
H A D | NodeTraversal.h | 77 // Does a reverse pre-order traversal to find the node that comes before the current one in document order 99 inline Element* firstElementWithinTemplate(NodeType* current) argument 102 Node* node = current->firstChild(); 107 inline Element* firstWithin(const ContainerNode* current) { return firstElementWithinTemplate(current); } argument 108 inline Element* firstWithin(const Node* current) { return firstElementWithinTemplate(current); } argument 111 inline Element* traverseNextElementTemplate(NodeType* current) argument 113 Node* node = NodeTraversal::next(current); 118 inline Element* next(const ContainerNode* current) { retur argument 119 next(const Node* current) argument 122 traverseNextElementTemplate(NodeType* current, const Node* stayWithin) argument 129 next(const ContainerNode* current, const Node* stayWithin) argument 130 next(const Node* current, const Node* stayWithin) argument 133 traverseNextElementSkippingChildrenTemplate(NodeType* current) argument 140 nextSkippingChildren(const ContainerNode* current) argument 141 nextSkippingChildren(const Node* current) argument 144 traverseNextElementSkippingChildrenTemplate(NodeType* current, const Node* stayWithin) argument 151 nextSkippingChildren(const ContainerNode* current, const Node* stayWithin) argument 152 nextSkippingChildren(const Node* current, const Node* stayWithin) argument 154 previousIncludingPseudo(const Node* current, const Node* stayWithin) argument 162 nextIncludingPseudo(const Node* current, const Node* stayWithin) argument 170 nextIncludingPseudoSkippingChildren(const Node* current, const Node* stayWithin) argument 178 pseudoAwarePreviousSibling(const Node* current) argument 194 traverseNextTemplate(NodeType* current) argument 202 next(const Node* current) argument 203 next(const ContainerNode* current) argument 206 traverseNextTemplate(NodeType* current, const Node* stayWithin) argument 216 next(const Node* current, const Node* stayWithin) argument 217 next(const ContainerNode* current, const Node* stayWithin) argument 220 traverseNextSkippingChildrenTemplate(NodeType* current) argument 226 nextSkippingChildren(const Node* current) argument 227 nextSkippingChildren(const ContainerNode* current) argument 230 traverseNextSkippingChildrenTemplate(NodeType* current, const Node* stayWithin) argument 238 nextSkippingChildren(const Node* current, const Node* stayWithin) argument 239 nextSkippingChildren(const ContainerNode* current, const Node* stayWithin) argument [all...] |
/macosx-10.9.5/vim-53/src/proto/ |
H A D | gui_xmdlg.pro | 2 char_u *gui_xm_select_font __ARGS((char_u *current));
|
/macosx-10.9.5/llvmCore-3425.0.33/lib/Support/ |
H A D | MemoryObject.cpp | 20 uint64_t current = address; local 23 if (current + size > limit) 26 while (current - address < size) { 27 if (readByte(current, &buf[(current - address)])) 30 current++; 34 *copied = current - address;
|
/macosx-10.9.5/JavaScriptCore-7537.78.1/API/tests/ |
H A D | Node.c | 52 NodeLink* current; local 54 for (currentHandle = &node->childNodesTail, current = *currentHandle; current; currentHandle = ¤t->prev, current = *currentHandle) { 55 if (current->node == child) { 56 Node_deref(current->node); 57 *currentHandle = current->prev; 58 free(current); 67 NodeLink* current; local [all...] |
/macosx-10.9.5/tcl-102/tcl_ext/incrtcl/incrTcl/itcl/tests/old/ |
H A D | BarFoo.tcl | 25 lappend WATCH [namespace current] 29 lappend WATCH [namespace current]
|
H A D | FooBar.tcl | 25 lappend WATCH [namespace current] 29 lappend WATCH [namespace current]
|
H A D | Bar.tcl | 23 lappend WATCH [namespace current] 27 lappend WATCH [namespace current]
|
H A D | Mongrel.tcl | 25 lappend WATCH [namespace current] 29 lappend WATCH [namespace current]
|
/macosx-10.9.5/CPANInternal-140/XML-SAX/SAX/PurePerl/Reader/ |
H A D | NoUnicodeExt.pm | 48 my $current = $self->[CURRENT]; 51 $self->next; $current .= $self->[CURRENT]; 52 $self->next; $current .= $self->[CURRENT]; 53 $self->next; $current .= $self->[CURRENT]; 54 $self->next; $current .= $self->[CURRENT]; 55 $self->next; $current .= $self->[CURRENT]; 59 $self->next; $current .= $self->[CURRENT]; 60 $self->next; $current .= $self->[CURRENT]; 61 $self->next; $current .= $self->[CURRENT]; 62 $self->next; $current [all...] |
/macosx-10.9.5/WebCore-7537.78.1/html/shadow/ |
H A D | InsertionPoint.cpp | 58 for (Node* current = firstDistributed(); current; current = nextDistributedTo(current)) { 59 if (!current->attached()) 60 current->attach(context); 71 for (Node* current = firstDistributed(); current; current = nextDistributedTo(current)) [all...] |
/macosx-10.9.5/nano-11/src/ |
H A D | move.c | 32 const filestruct *current_save = openfile->current; 35 openfile->current = openfile->fileage; 45 const filestruct *current_save = openfile->current; 48 openfile->current = openfile->filebot; 64 if (openfile->current->lineno <= editwinrows - 2) { 74 openfile->current = openfile->edittop; 80 for (i = editwinrows - 2; i > 0 && openfile->current != 82 openfile->current = openfile->current->prev; 84 openfile->current_x = actual_x(openfile->current [all...] |
/macosx-10.9.5/BerkeleyDB-21/db/java/src/com/sleepycat/util/ |
H A D | ErrorBuffer.java | 5 int first, current; field in class:ErrorBuffer 13 msgs[current] = msg; 14 current = (current + 1) % msgs.length; 15 if (current == first) 21 for (int i = first; i != current; i = (i + 1) % msgs.length) { 23 if ((i + 1) % msgs.length != current) 30 current = first = 0;
|
/macosx-10.9.5/CommonCrypto-60049/libcn/ |
H A D | normal_crc.c | 59 crc_normal_update(crcInfoPtr crc, uint8_t *p, size_t len, uint64_t current) argument 63 case 1: current = crc_table_value8(crc->table.bytes, *p, (uint8_t) current); break; 64 case 2: current = crc_table_value16(crc->table.b16, *p, (uint16_t) current); break; 65 case 4: current = crc_table_value32(crc->table.b32, *p, (uint32_t) current); break; 66 case 8: current = crc_table_value64(crc->table.b64, *p, current); break; 70 return current 75 crc_normal_final(crcInfoPtr crc, uint64_t current) argument 86 uint64_t current = crc->descriptor->def.parms.initial_value; local [all...] |
H A D | reverse_crc.c | 59 crc_reverse_update(crcInfoPtr crc, uint8_t *p, size_t len, uint64_t current) argument 63 case 1: current = crc_table_value8(crc->table.bytes, *p, (uint8_t) current); break; 64 case 2: current = crc_table_value16(crc->table.b16, *p, (uint16_t) current); break; 65 case 4: current = crc_table_value32(crc->table.b32, *p, (uint32_t) current); break; 66 case 8: current = crc_table_value64(crc->table.b64, *p, current); break; 69 return current; 74 crc_reverse_final(crcInfoPtr crc, uint64_t current) argument 85 uint64_t current = crc->descriptor->def.parms.initial_value; local [all...] |
/macosx-10.9.5/tcl-102/tk/tk/generic/ttk/ |
H A D | ttk.decls | 10 declare 0 current { 13 declare 1 current { 16 declare 2 current { 19 declare 3 current { 23 declare 4 current { 28 declare 5 current { 36 declare 6 current { 45 declare 7 current { 53 declare 8 current { 61 declare 10 current { [all...] |
/macosx-10.9.5/ruby-104/ruby/ext/fiddle/lib/ |
H A D | fiddle.rb | 7 # Returns the last win32 +Error+ of the current executing +Thread+ or nil 10 Thread.current[:__FIDDLE_WIN32_LAST_ERROR__] 13 # Sets the last win32 +Error+ of the current executing +Thread+ to +error+ 15 Thread.current[:__FIDDLE_WIN32_LAST_ERROR__] = error 19 # Returns the last +Error+ of the current executing +Thread+ or nil if none 21 Thread.current[:__FIDDLE_LAST_ERROR__] 24 # Sets the last +Error+ of the current executing +Thread+ to +error+ 26 Thread.current[:__DL2_LAST_ERROR__] = error 27 Thread.current[:__FIDDLE_LAST_ERROR__] = error
|
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory/t/ |
H A D | 95_Tree_Simple_Visitor_LoadClassHierarchy_test.t | 56 my $current = $tree->getChild(0); 57 is($current->getNodeValue(), 'E', '... got the value we expected'); 58 is($current->getChild(0)->getNodeValue(), 'C', '... got the value we expected'); 59 is($current->getChild(0)->getChild(0)->getNodeValue(), 'A', '... got the value we expected'); 60 is($current->getChild(1)->getNodeValue(), 'D', '... got the value we expected'); 61 is($current->getChild(1)->getChild(0)->getNodeValue(), 'A', '... got the value we expected'); 62 is($current->getChild(1)->getChild(1)->getNodeValue(), 'B', '... got the value we expected'); 82 my $current = $tree; 83 is($current->getNodeValue(), 'E', '... got the value we expected'); 84 is($current [all...] |
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/t/ |
H A D | 95_Tree_Simple_Visitor_LoadClassHierarchy_test.t | 56 my $current = $tree->getChild(0); 57 is($current->getNodeValue(), 'E', '... got the value we expected'); 58 is($current->getChild(0)->getNodeValue(), 'C', '... got the value we expected'); 59 is($current->getChild(0)->getChild(0)->getNodeValue(), 'A', '... got the value we expected'); 60 is($current->getChild(1)->getNodeValue(), 'D', '... got the value we expected'); 61 is($current->getChild(1)->getChild(0)->getNodeValue(), 'A', '... got the value we expected'); 62 is($current->getChild(1)->getChild(1)->getNodeValue(), 'B', '... got the value we expected'); 82 my $current = $tree; 83 is($current->getNodeValue(), 'E', '... got the value we expected'); 84 is($current [all...] |
/macosx-10.9.5/ruby-104/ruby/ext/tk/sample/tkextlib/vu/ |
H A D | vu_demo.rb | 26 current = 50 34 current += 1 36 current -= 1 38 bar.set(current) 39 if current < green 40 current = 100 if current <= 0 42 elsif current < blue 44 elsif current < purple 48 current [all...] |
/macosx-10.9.5/ruby-104/ruby/lib/rexml/validation/ |
H A D | relaxng.rb | 40 attr_accessor :current 50 @root = @current = Sequence.new(self) 52 states = [ @current ] 130 @current = 0 137 return if @current == 0 138 @current = 0 148 #puts "Next (#@current) is #{@events[@current]}" 150 return @previous.pop.next( event ) if @events[@current].nil? 151 expand_ref_in( @events, @current ) i [all...] |
/macosx-10.9.5/WebCore-7537.78.1/css/ |
H A D | CSSSelectorList.h | 55 const CSSSelector* current = selectorAt(index); local 56 current = next(current); 57 if (!current) 59 return current - m_selectorArray; 77 inline const CSSSelector* CSSSelectorList::next(const CSSSelector* current) argument 80 while (!current->isLastInTagHistory()) 81 current++; 82 return current->isLastInSelectorList() ? 0 : current [all...] |
/macosx-10.9.5/xnu-2422.115.4/bsd/net/ |
H A D | init.c | 86 struct init_list_entry *current = 0; local 98 current = backward_head; 99 backward_head = current->next; 100 current->next = forward_head; 101 forward_head = current; 106 current = forward_head; 107 forward_head = current->next; 108 current->func(); 109 kfree(current, sizeof(*current)); [all...] |
/macosx-10.9.5/cups-372.4/cups/cups/ |
H A D | array.c | 24 * cupsArrayCurrent() - Return the current element in the array. 29 * cupsArrayGetIndex() - Get the index of the current element. 41 * cupsArrayRestore() - Reset the current element to the last @link 43 * cupsArraySave() - Mark the current element for a later @link 73 * The current implementation uses an insertion sort into an array of 81 current, /* Current element */ member in struct:_cups_array_s 205 * Find the end of the current delimited string and see if we need to add 276 a->current = -1; 308 * 'cupsArrayCurrent()' - Return the current element in the array. 310 * The current elemen 479 int current, /* Current element */ local 922 current, /* Current element */ local 1057 current, /* Current element */ local 1238 current, /* Current element */ local [all...] |
/macosx-10.9.5/xnu-2422.115.4/osfmk/kern/ |
H A D | call_entry.h | 110 call_entry_t current; local 114 current = CE(queue_first(queue)); 117 current = CE(queue_first(queue)); 119 current = CE(queue_next(qe(entry))); 124 if (queue_end(queue, qe(current)) || 125 deadline < current->deadline) { 126 current = CE(queue_prev(qe(current))); 130 current = CE(queue_next(qe(current))); [all...] |