/external/chromium_org/chrome/browser/history/ |
H A D | visit_tracker.cc | 27 // searches of the transitions list. This transitions list is kept to a 40 TransitionList& transitions = *i->second; 55 // goes back). We can ignore future transitions because if you navigate, go 58 for (int i = static_cast<int>(transitions.size()) - 1; i >= 0; i--) { 59 if (transitions[i].page_id <= page_id && transitions[i].url == referrer) { 61 return transitions[i].visit_id; 73 TransitionList* transitions = contexts_[context_id]; 74 if (!transitions) { [all...] |
H A D | visit_tracker.h | 16 // Tracks history transitions between pages. The history backend uses this to 17 // link up page transitions to form a chain of page visits, and to set the 34 // transitions/visit IDs for it. 56 void CleanupTransitionList(TransitionList* transitions); 58 // Maps render view hosts to lists of recent transitions.
|
/external/chromium_org/third_party/polymer/components-chromium/core-animated-pages/transitions/ |
H A D | core-transition-pages-extracted.js | 6 var transitions = CoreStyle.g.transitions = CoreStyle.g.transitions || {}; 7 transitions.duration = '500ms'; 8 transitions.heroDelay = '50ms'; 9 transitions.scaleDelay = '500ms'; 10 transitions.cascadeFadeDuration = '250ms';
|
H A D | hero-transition-extracted.js | 23 (CoreStyle.g.transitions.heroDuration || 24 CoreStyle.g.transitions.duration); 27 var d = h.h0.hasAttribute('hero-delayed') ? CoreStyle.g.transitions.heroDelay : '';
|
/external/chromium_org/v8/src/ |
H A D | transitions.cc | 8 #include "src/transitions-inl.h" 67 DCHECK(!containing_map->transitions()->IsFullTransitionArray()); 68 int nof = containing_map->transitions()->number_of_transitions(); 73 int new_nof = containing_map->transitions()->number_of_transitions(); 79 containing_map->transitions(), kSimpleTransitionIndex, 0); 83 containing_map->transitions()->back_pointer_storage()); 96 int number_of_transitions = map->transitions()->number_of_transitions(); 99 int insertion_index = map->transitions()->Search(*name); 109 TransitionArray* array = map->transitions();
|
H A D | transitions-inl.h | 8 #include "src/transitions.h" 68 void TransitionArray::SetPrototypeTransitions(FixedArray* transitions, argument 71 DCHECK(transitions->IsFixedArray()); 73 WRITE_FIELD(this, kPrototypeTransitionsOffset, transitions); 75 heap, this, kPrototypeTransitionsOffset, transitions, mode);
|
H A D | objects-printer.cc | 346 TransitionArray* transitions = map()->transitions(); 347 for (int i = 0; i < transitions->number_of_transitions(); i++) { 348 Name* key = transitions->GetKey(i); 356 << ElementsKindToString(transitions->GetTarget(i)->elements_kind()) 361 switch (transitions->GetTargetDetails(i).type()) { 457 os << "\n - transitions: " << Brief(transitions());
|
/external/chromium_org/third_party/cython/src/Cython/Plex/ |
H A D | DFA.py | 20 # the epsilon-closure of each initial old state. Then we give transitions 21 # to each new state which are the union of all transitions out of any 38 transitions = TransitionMap() 40 for event, old_target_states in old_state.transitions.iteritems(): 42 transitions.add_set(event, set_epsilon_closure(old_target_states)) 43 for event, old_states in transitions.iteritems(): 81 state_set_2 = state.transitions.get_epsilon()
|
H A D | Machines.py | 61 transitions = None # TransitionMap variable in class:Node 68 # Preinitialise the list of empty transitions, because 70 #self.transitions = {'':[]} 71 self.transitions = TransitionMap() 76 self.transitions = None 81 self.transitions.add(event, new_state) 112 self.transitions.dump(file) 148 for event, old_state_set in old_state.transitions.iteritems():
|
/external/bison/src/ |
H A D | state.c | 40 static transitions * 44 transitions *res = xmalloc (offsetof (transitions, states) + states_size); 57 transitions_to (transitions *shifts, symbol_number sym) 70 | Error transitions. | 141 res->transitions = NULL; 168 res->transitions = 169 transitions_new (s->transitions->num, s->transitions->states); 191 free (s->transitions); [all...] |
H A D | state.h | 54 Each transition structure describes the possible transitions out 56 contains a vector of numbers of the states that transitions can go 61 deletes transitions by having them point to zero. 115 } transitions; typedef in typeref:struct:__anon385 162 struct state *transitions_to (transitions *shifts, symbol_number sym); 202 transitions *transitions; member in struct:state 234 /* Set the transitions of STATE. */
|
H A D | lalr.c | 84 transitions *sp = states[s]->transitions; 118 transitions *sp = states[s]->transitions; 172 transitions *sp = states[stateno]->transitions; 243 s = transitions_to (s->transitions, 333 transitions *sp = s->transitions;
|
H A D | conflicts.c | 224 transitions *trans = s->transitions; 332 transitions *trans = s->transitions; 432 transitions *trans = s->transitions;
|
H A D | graphviz.c | 92 FOR_EACH_SHIFT (s->transitions, n) 93 bitset_set (*no_reduce_set, TRANSITION_SYMBOL (s->transitions, n)); 103 /* If no lookahead tokens were valid transitions, this reduction is 184 /* Build the lookahead tokens lists, one for enabled transitions and one
|
H A D | print_graph.c | 142 transitions const *trans = s->transitions;
|
H A D | ielr.c | 261 transitions *trans = states[to_state[i]]->transitions; 311 for (j = 0; j < states[i]->transitions->num; ++j) 312 ++predecessor_counts[states[i]->transitions->states[j]->number]; 323 for (j = 0; j < states[i]->transitions->num; ++j) 325 state_number k = states[i]->transitions->states[j]->number; 829 for (i = 0; i < (*tp)->transitions->num; ++i) 831 state *t2 = (*tp)->transitions->states[i]; 903 &(*tp)->transitions->states[i]); 1001 for (i = 0; i < s->transitions [all...] |
H A D | print-xml.c | 127 transitions *trans = s->transitions; 139 xml_puts (out, level, "<transitions/>"); 144 xml_puts (out, level, "<transitions>"); 172 xml_puts (out, level, "</transitions>"); 242 transitions *trans = s->transitions;
|
H A D | print.c | 131 transitions *trans = s->transitions; 243 transitions *trans = s->transitions;
|
/external/chromium_org/chrome/tools/ |
H A D | history-viz.py | 86 the .transitions array.""" 90 self.transitions = [] 95 for trans in self.transitions: 172 edge.transitions.append(trans) 212 # Gather up all the transitions into the label. 214 transitions = edge.Transitions() 215 for trans, count in transitions.items(): 237 # If the edge is from the start and the transitions are fishy, make it 239 if src == '0' and len(transitions.keys()) == 1 and transitions [all...] |
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitperl/VCSUtils_unittest/ |
H A D | mergeChangeLogs.pl | 100 + JSC is failing to propagate anonymous slot count on some transitions 128 JSC is failing to propagate anonymous slot count on some transitions 165 - JSC is failing to propagate anonymous slot count on some transitions 207 JSC is failing to propagate anonymous slot count on some transitions 254 JSC is failing to propagate anonymous slot count on some transitions 296 JSC is failing to propagate anonymous slot count on some transitions 311 JSC is failing to propagate anonymous slot count on some transitions
|
/external/chromium_org/third_party/icu/source/tools/tzcode/ |
H A D | tz2icu.cpp | 157 // A collection of transitions from one ZoneType to another, together 159 // list of transitions between a smaller list of ZoneTypes. 164 vector<Transition> transitions; member in struct:ZoneInfo 362 // Build transitions vector out of corresponding times and types. 375 // transitions into zoneinfo.res, because data is limited to singed 379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); 384 // If there are any transitions before the 32bit minimum time, 386 vector<Transition>::iterator itr = info.transitions.begin(); 387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); 395 info.transitions [all...] |
/external/icu/icu4c/source/tools/tzcode/ |
H A D | tz2icu.cpp | 157 // A collection of transitions from one ZoneType to another, together 159 // list of transitions between a smaller list of ZoneTypes. 164 vector<Transition> transitions; member in struct:ZoneInfo 362 // Build transitions vector out of corresponding times and types. 375 // transitions into zoneinfo.res, because data is limited to singed 379 info.transitions.push_back(Transition(transitionTimes[i], transitionTypes[i])); 384 // If there are any transitions before the 32bit minimum time, 386 vector<Transition>::iterator itr = info.transitions.begin(); 387 info.transitions.insert(itr, Transition(LOWEST_TIME32, transitionTypes[minidx])); 395 info.transitions [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | DFAState.java | 74 /** Track the transitions emanating from this DFA state. The List 77 protected List<Transition> transitions = field in class:DFAState 156 * can easily check for non-epsilon transitions because the only 159 * for all possible transitions. That is of the order: size(label space) 177 return (Transition)transitions.get(i); 181 return transitions.size(); 185 transitions.add(t); 192 transitions.add( new Transition(label, target) ); 193 return transitions.size()-1; 197 return transitions [all...] |
/external/chromium_org/third_party/polymer/components-chromium/core-animated-pages/ |
H A D | core-animated-pages-extracted.js | 10 * A space-delimited string of transitions to use when switching between pages in this element. 14 * @attribute transitions 18 transitions: '', 23 * The last page selected. This property is useful to dynamically set transitions based 42 this._transitions = this.transitions.split(' ');
|
/external/chromium_org/v8/src/heap/ |
H A D | objects-visiting-inl.h | 315 // When map collection is enabled we have to mark through map's transitions 604 // inside its transitions array is marked. Skip recording the back 608 // Treat pointers in the transitions array as weak and also mark that 613 TransitionArray* transitions = map->transitions(); local 614 MarkTransitionArray(heap, transitions); 644 // Mark the pointer fields of the Map. Since the transitions array has 655 Heap* heap, TransitionArray* transitions) { 656 if (!StaticVisitor::MarkObjectWithoutPush(heap, transitions)) return; 658 // Simple transitions d 654 MarkTransitionArray( Heap* heap, TransitionArray* transitions) argument [all...] |