Home
last modified time | relevance | path

Searched refs:previous (Results 1 - 25 of 438) sorted by relevance

12345678910>>...18

/third_party/python/Lib/idlelib/idle_test/
H A Dtest_autoexpand.py51 previous = self.auto_expand.getprevword
54 equal(previous(), '')
57 equal(previous(), 't')
60 equal(previous(), 'this')
63 equal(previous(), '')
66 equal(previous(), 'is')
69 equal(previous(), 'string')
72 equal(previous(), '')
75 equal(previous(), '')
78 previous
[all...]
/third_party/typescript/tests/baselines/reference/
H A DmappedTypes5.js28 readonly previous: Readonly<Partial<T>>;
33 readonly previous: Partial<Readonly<T>>;
38 let previous: Partial<T> = Object.create(null);
40 let args1: Args1<T> = { previous, current };
41 let args2: Args2<T> = { previous, current };
47 readonly previous: Readonly<Partial<State2>>;
52 readonly previous: Partial<Readonly<State2>>;
57 let previous: Partial<State2> = Object.create(null);
59 let args1: Args3 = { previous, current };
60 let args2: Args4 = { previous, curren
[all...]
/third_party/elfutils/lib/
H A Dlist.h37 assert (_newp->previous == NULL); \
39 (first) = _newp->next = _newp->previous = _newp; \
43 _newp->previous = (first)->previous; \
44 _newp->previous->next = _newp->next->previous = _newp; \
66 _elem->next->previous = _elem->previous; \
67 _elem->previous->next = _elem->next; \
71 assert ((_elem->next = _elem->previous
[all...]
/third_party/ntfs-3g/libntfs-3g/
H A Dcache.c107 struct HASH_ENTRY *previous; in drophashindex() local
113 previous = (struct HASH_ENTRY*)NULL; in drophashindex()
115 previous = link; in drophashindex()
119 if (previous) in drophashindex()
120 previous->next = link->next; in drophashindex()
151 struct CACHED_GENERIC *previous; in ntfs_fetch_cache() local
181 previous = current->previous; in ntfs_fetch_cache()
183 if (previous) { in ntfs_fetch_cache()
188 previous in ntfs_fetch_cache()
338 struct CACHED_GENERIC *previous; do_invalidate() local
[all...]
/third_party/icu/tools/colprobe/
H A Dsortedlines.cpp157 logger->log("Cannot deduce distance from empty using previous element. Something is very wrong! Line:"); in classifyRepertoire()
318 (*(sortingArray+i+1))->previous = curr; in sort()
693 // check whether the previous is contraction and if not, add the current in detectContractions()
721 if(left->right && left->right->previous && left->right->next) { in noteContraction()
722 test.setToConcat(left->left, left->right->previous); in noteContraction()
736 if(right->previous && right->next) { in noteContraction()
737 trial1.setToConcat(left, right->previous); in noteContraction()
748 if(left->previous && left->next) { in noteContraction()
749 trial1.setToConcat(left->previous, right); in noteContraction()
763 if(right->right && right->right->strengthFromEmpty > UCOL_PRIMARY && right->left->previous in noteContraction()
810 getExpansionLine(const Line &expansion, const Line &previous, const Line &exp, Line &expansionLine) getExpansionLine() argument
1033 Line *previous, trial, expansionLine; detectExpansions() local
1375 Line *previous = sortedLines[0]; arrayToString() local
1486 Line *previous = toSort[0]; toFile() local
1515 Line *previous = toSort[0]; toStringFromEmpty() local
1971 transferCumulativeStrength(Line *previous, Line *that) transferCumulativeStrength() argument
[all...]
H A Dcolprobe.cpp480 (*currLine)->previous = *prevLine; in analyzeStrength()
533 Line *previous = *lines; in printOrdering() local
534 if(previous->isReset) { in printOrdering()
536 escapeALine(previous, file); in printOrdering()
537 } else if(!previous->isRemoved) { in printOrdering()
538 printLine(previous, file); in printOrdering()
541 while(i < size && previous->next) { in printOrdering()
543 line = previous->next; in printOrdering()
560 previous = line; in printOrdering()
573 line->previous in setIndexes()
1156 Line *previous = NULL; reduceUntailored() local
[all...]
/third_party/node/test/fixtures/postject-copy/node_modules/commander/lib/
H A Dargument.js58 _concatValue(value, previous) {
59 if (previous === this.defaultValue || !Array.isArray(previous)) {
63 return previous.concat(value);
101 this.parseArg = (arg, previous) => {
106 return this._concatValue(arg, previous);
H A Doption.js161 _concatValue(value, previous) {
162 if (previous === this.defaultValue || !Array.isArray(previous)) {
166 return previous.concat(value);
178 this.parseArg = (arg, previous) => {
183 return this._concatValue(arg, previous);
/third_party/icu/icu4c/source/common/
H A Dulist.cpp20 UListNode *previous; member
63 newItem->previous = NULL; in ulist_addFirstItem()
69 if (p->previous == NULL) { in ulist_removeItem()
73 p->previous->next = p->next; in ulist_removeItem()
77 list->tail = p->previous; in ulist_removeItem()
79 p->next->previous = p->previous; in ulist_removeItem()
116 newItem->previous = list->tail; in ulist_addItemEndList()
148 newItem->previous = NULL; in ulist_addItemBeginList()
150 list->head->previous in ulist_addItemBeginList()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dulist.cpp20 UListNode *previous; member
63 newItem->previous = nullptr; in ulist_addFirstItem()
69 if (p->previous == nullptr) { in ulist_removeItem()
73 p->previous->next = p->next; in ulist_removeItem()
77 list->tail = p->previous; in ulist_removeItem()
79 p->next->previous = p->previous; in ulist_removeItem()
116 newItem->previous = list->tail; in ulist_addItemEndList()
148 newItem->previous = nullptr; in ulist_addItemBeginList()
150 list->head->previous in ulist_addItemBeginList()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dulist.cpp20 UListNode *previous; member
63 newItem->previous = NULL; in ulist_addFirstItem()
69 if (p->previous == NULL) { in ulist_removeItem()
73 p->previous->next = p->next; in ulist_removeItem()
77 list->tail = p->previous; in ulist_removeItem()
79 p->next->previous = p->previous; in ulist_removeItem()
116 newItem->previous = list->tail; in ulist_addItemEndList()
148 newItem->previous = NULL; in ulist_addItemBeginList()
150 list->head->previous in ulist_addItemBeginList()
[all...]
/third_party/mesa3d/src/gallium/frontends/nine/
H A Dthreadpool.c145 struct threadpool_task *task, *previous; in _mesa_threadpool_queue_task() local
168 previous = pool->workqueue; in _mesa_threadpool_queue_task()
169 while (previous && previous->next) in _mesa_threadpool_queue_task()
170 previous = previous->next; in _mesa_threadpool_queue_task()
172 previous->next = task; in _mesa_threadpool_queue_task()
/third_party/ffmpeg/libavcodec/
H A Dhnm4video.c44 uint8_t *previous; member
156 uint8_t tag, previous, backline, backward, swap; in decode_interframe_v4() local
198 previous = bytestream2_peek_byte(&gb) & 0x20; in decode_interframe_v4()
233 if (previous) { in decode_interframe_v4()
236 hnm->current[writeoffset++] = hnm->previous[offset - (2 * hnm->width) + 1]; in decode_interframe_v4()
237 hnm->current[writeoffset++] = hnm->previous[offset++]; in decode_interframe_v4()
240 hnm->current[writeoffset++] = hnm->previous[offset++]; in decode_interframe_v4()
241 hnm->current[writeoffset++] = hnm->previous[offset++]; in decode_interframe_v4()
285 uint8_t tag, count, previous, delta; in decode_interframe_v4a() local
315 previous in decode_interframe_v4a()
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DCharacterIteration.java38 ci.previous(); in next32()
54 ci.previous(); in next32()
79 ci.previous(); in nextTrail32()
89 char trail = ci.previous(); in previous32()
92 char lead = ci.previous(); in previous32()
112 ci.previous(); in current32()
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/impl/
H A DCharacterIteration.java42 ci.previous(); in next32()
58 ci.previous(); in next32()
83 ci.previous(); in nextTrail32()
93 char trail = ci.previous(); in previous32()
96 char lead = ci.previous(); in previous32()
116 ci.previous(); in current32()
/third_party/glfw/src/
H A Dcontext.c349 _GLFWwindow* previous; in _glfwRefreshContextAttribs() local
362 previous = _glfwPlatformGetTls(&_glfw.contextSlot); in _glfwRefreshContextAttribs()
374 glfwMakeContextCurrent((GLFWwindow*) previous); in _glfwRefreshContextAttribs()
392 glfwMakeContextCurrent((GLFWwindow*) previous); in _glfwRefreshContextAttribs()
424 glfwMakeContextCurrent((GLFWwindow*) previous); in _glfwRefreshContextAttribs()
454 glfwMakeContextCurrent((GLFWwindow*) previous); in _glfwRefreshContextAttribs()
470 glfwMakeContextCurrent((GLFWwindow*) previous); in _glfwRefreshContextAttribs()
569 // previous uses of our bit of VRAM in _glfwRefreshContextAttribs()
579 glfwMakeContextCurrent((GLFWwindow*) previous); in _glfwRefreshContextAttribs()
621 _GLFWwindow* previous; in glfwMakeContextCurrent() local
[all...]
/third_party/python/Modules/
H A Dfaulthandler.c72 _Py_sighandler_t previous; member
111 _Py_sighandler_t previous; member
310 (void)sigaction(handler->signum, &handler->previous, NULL); in faulthandler_disable_fatal_handler()
312 (void)signal(handler->signum, handler->previous); in faulthandler_disable_fatal_handler()
319 Display the current Python traceback, restore the previous handler and call
320 the previous handler.
322 On Windows, don't explicitly call the previous handler, because the Windows
325 instruction will raise the same fault (signal), and so the previous handler
354 /* restore the previous handler */ in faulthandler_fatal_error()
378 /* don't explicitly call the previous handle in faulthandler_fatal_error()
915 _Py_sighandler_t previous; faulthandler_register_py() local
[all...]
/third_party/ninja/src/
H A Dedit_distance.cc37 // iteration, and the top-left entry is stored in previous. in EditDistance()
49 int previous = y - 1; in EditDistance() local
53 row[x] = min(previous + (s1.str_[y - 1] == s2.str_[x - 1] ? 0 : 1), in EditDistance()
58 row[x] = previous; in EditDistance()
62 previous = old_row; in EditDistance()
/third_party/python/Objects/stringlib/
H A Dlocaleutil.h5 char previous; member
15 self->previous = 0; in GroupGenerator_init()
29 return self->previous; in GroupGenerator_next()
35 self->previous = ch; in GroupGenerator_next()
/third_party/pulseaudio/src/pulse/
H A Dmainloop-signal.c56 pa_signal_event *previous, *next; member
188 e->previous = NULL; in pa_signal_new()
202 e->next->previous = e->previous; in pa_signal_free()
203 if (e->previous) in pa_signal_free()
204 e->previous->next = e->next; in pa_signal_free()
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dbackward_references_cost_enc.c341 // Given two intervals, make 'prev' be the previous one of 'next' in 'manager'.
392 // Given a current orphan interval and its previous interval, before
394 // of intervals using the start_ ordering and the previous interval as a hint.
397 CostInterval* previous) { in PositionOrphanInterval()
400 if (previous == NULL) previous = manager->head_; in PositionOrphanInterval()
401 while (previous != NULL && current->start_ < previous->start_) { in PositionOrphanInterval()
402 previous = previous in PositionOrphanInterval()
395 PositionOrphanInterval(CostManager* const manager, CostInterval* const current, CostInterval* previous) PositionOrphanInterval() argument
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DUCharacterIterator.java166 previous(); in currentCodePoint()
220 previous(); in nextCodePoint()
227 * Decrement to the position of the previous code unit in the text, and return it (pre-decrement semantics). If the
230 * @return the previous code unit in the text, or DONE if the new index is before the start of the text.
233 public abstract int previous(); in previous() method in UCharacterIterator
236 * Retreat to the start of the previous code point in the text, and return it (pre-decrement semantics). If the
237 * index is not preceded by a valid surrogate pair, the behavior is the same as <code>previous()</code>. Otherwise
241 * @return the previous code point in the text, or DONE if the new index is before the start of the text.
245 int ch1 = previous(); in previousCodePoint()
247 int ch2 = previous(); in previousCodePoint()
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DUCharacterIterator.java155 previous(); in currentCodePoint()
205 previous(); in nextCodePoint()
212 * Decrement to the position of the previous code unit in the text, and return it (pre-decrement semantics). If the
215 * @return the previous code unit in the text, or DONE if the new index is before the start of the text.
217 public abstract int previous(); in previous() method in UCharacterIterator
220 * Retreat to the start of the previous code point in the text, and return it (pre-decrement semantics). If the
221 * index is not preceeded by a valid surrogate pair, the behavior is the same as <code>previous()</code>. Otherwise
225 * @return the previous code point in the text, or DONE if the new index is before the start of the text.
228 int ch1 = previous(); in previousCodePoint()
230 int ch2 = previous(); in previousCodePoint()
[all...]
/third_party/libdrm/tests/
H A Ddrmsl.c64 unsigned long previous; in do_time() local
79 previous = 0; in do_time()
82 if (key <= previous) { in do_time()
83 printf( "%lu !< %lu\n", previous, key); in do_time()
85 previous = key; in do_time()
/third_party/node/deps/v8/src/tasks/
H A Dcancelable-task.h118 bool TryRun(Status* previous = nullptr) { in TryRun()
119 return CompareExchangeStatus(kWaiting, kRunning, previous); in TryRun()
130 Status* previous = nullptr) { in CompareExchangeStatus()
135 if (previous) *previous = expected; in CompareExchangeStatus()

Completed in 14 milliseconds

12345678910>>...18