Home
last modified time | relevance | path

Searched refs:it (Results 1 - 18 of 18) sorted by relevance

/commonlibrary/c_utils/base/test/unittest/common/
H A Dutils_sorted_vector_test.cpp40 auto it = svec.Begin(); in HWTEST_F() local
43 for (; (it != svec.End()) and (it2 != vec.end()); it2++, it++) { in HWTEST_F()
44 ASSERT_EQ(*it, *it2); in HWTEST_F()
63 auto it = newSvec.Begin(); in HWTEST_F() local
66 for (; (it != newSvec.End()) and (it2 != vec.end()); it2++, it++) { in HWTEST_F()
67 ASSERT_EQ(*it, *it2); in HWTEST_F()
149 auto it = newSvec.Begin(); in HWTEST_F() local
152 for (; (it ! in HWTEST_F()
254 auto it = newSvec.Begin(); HWTEST_F() local
310 auto it = svec.Begin(); HWTEST_F() local
332 auto it = svec.Begin(); HWTEST_F() local
376 auto it = svec.Begin(); HWTEST_F() local
[all...]
H A Dutils_rwlock_test.cpp39 for (auto it = str.begin(); it != str.end(); it++) { in WriteStr()
40 buf.push_back(*it); in WriteStr()
50 for (auto it = buf.begin(); it != buf.end(); it++) { in ReadStr()
51 str.push_back(*it); in ReadStr()
H A Dutils_refbase_test.cpp242 auto it = objects1_.find(descriptor); in QueryObjectInner() local
243 if (it != objects1_.end()) in QueryObjectInner()
245 it->second->AttemptAcquire(this); in QueryObjectInner()
247 return it->second.GetRefPtr(); in QueryObjectInner()
/commonlibrary/c_utils/base/test/benchmarktest/sorted_vector_benchmark_test/
H A Dsorted_vector_benchmark_test.cpp74 auto it = svec.Begin(); in BENCHMARK_F() local
76 for (; (it != svec.End()) and (it2 != vec.end()); it2++, it++) { in BENCHMARK_F()
77 AssertEqual(*it, *it2, "*it did not equal *it2 as expected.", state); in BENCHMARK_F()
98 auto it = newSvec.Begin(); in BENCHMARK_F() local
100 for (; (it != newSvec.End()) and (it2 != vec.end()); it2++, it++) { in BENCHMARK_F()
101 AssertEqual(*it, *it2, "*it di in BENCHMARK_F()
196 auto it = newSvec.Begin(); BENCHMARK_F() local
305 auto it = newSvec.Begin(); BENCHMARK_F() local
373 auto it = svec.Begin(); BENCHMARK_F() local
397 auto it = svec.Begin(); BENCHMARK_F() local
441 auto it = svec.Begin(); BENCHMARK_F() local
759 auto it = newSvec.Begin(); BENCHMARK_F() local
[all...]
/commonlibrary/ets_utils/js_concurrent_module/taskpool/
H A Dtask_queue.cpp26 auto it = std::find(tasks_.begin(), tasks_.end(), taskId); in EraseWaitingTaskId() local
27 if (it != tasks_.end()) { in EraseWaitingTaskId()
28 tasks_.erase(it); in EraseWaitingTaskId()
H A Dtask_manager.cpp247 // if the worker thread is idle, just skip it, and only the worker in running state can be marked as timeout in CheckForBlockedWorkers()
256 // Besides, if the worker is not executing sync tasks or micro tasks, it may handle in CheckForBlockedWorkers()
270 // If the current worker has a longTask and is not executing, we will only interrupt it. in CheckForBlockedWorkers()
442 // remove it from all sets in TriggerShrink()
482 // System memory state is moderate and the worker has exeuted tasks, we will try to release it in NotifyShrink()
590 // 2. Find executing taskInfo, skip it in CancelTask()
591 // 3. Find waiting taskInfo, cancel it in CancelTask()
592 // 4. Find canceled taskInfo, skip it in CancelTask()
799 // If worker->state_ is WorkerState::IDLE, it means that the worker is free in IsChooseIdle()
825 // When there are only idle tasks and workers executing them, it i in NotifyExecuteTask()
[all...]
/commonlibrary/c_utils/base/test/benchmarktest/rwlock_benchmark_test/
H A Drwlock_benchmark_test.cpp64 for (auto it = str.begin(); it != str.end(); it++) { in WriteStr()
65 buf_.push_back(*it); in WriteStr()
76 for (auto it = buf_.begin(); it != buf_.end(); it++) { in ReadStr()
77 str.push_back(*it); in ReadStr()
/commonlibrary/c_utils/base/include/
H A Dsorted_vector.h114 * @brief Accesses the first item in this vector while editing it.
349 auto it = std::lower_bound(std::begin(vec_), std::end(vec_), item); in IndexOf() local
350 if (it == vec_.end() || !(*it == item)) { in IndexOf()
353 return it - vec_.begin(); in IndexOf()
359 auto it = std::upper_bound(vec_.begin(), vec_.end(), item); in OrderOf() local
360 return it - vec_.begin(); in OrderOf()
371 auto it = std::upper_bound(vec_.begin(), vec_.end(), item); in Add() local
372 it = vec_.insert(it, ite in Add()
[all...]
H A Dsafe_map.h210 for (auto it = map_.begin(); it != map_.end(); it++) { in Iterate()
211 callback(it -> first, it -> second); in Iterate()
/commonlibrary/ets_utils/js_concurrent_module/utils/locks/
H A Dasync_lock_manager.cpp220 auto it = anonymousLockMap.find(identity->id); in Destructor() local
221 if ((it != anonymousLockMap.end()) && (it->second->DecRefCount() == 0)) { in Destructor()
222 anonymousLockMap.erase(it); in Destructor()
225 auto it = lockMap.find(identity->name); in Destructor() local
226 if ((it != lockMap.end()) && (it->second->DecRefCount() == 0)) { in Destructor()
227 lockMap.erase(it); in Destructor()
431 auto it = anonymousLockMap.find(id->id); in FindAsyncLockUnsafe() local
432 if (it in FindAsyncLockUnsafe()
437 auto it = lockMap.find(id->name); FindAsyncLockUnsafe() local
[all...]
H A Dasync_lock.cpp62 auto it = std::find(heldList_.begin(), heldList_.end(), lockRequest); in CleanUpLockRequestOnCompletion() local
63 if (it == heldList_.end()) { in CleanUpLockRequestOnCompletion()
67 heldList_.erase(it); in CleanUpLockRequestOnCompletion()
81 auto it = std::find(pendingList_.begin(), pendingList_.end(), lockRequest); in CleanUpLockRequestOnTimeout() local
82 if (it == pendingList_.end()) { in CleanUpLockRequestOnTimeout()
87 pendingList_.erase(it); in CleanUpLockRequestOnTimeout()
116 // No more refs to the lock. We need to delete the instance but we cannot do it right now in ProcessPendingLockRequestUnsafe()
117 // because asyncLockMutex_ is acquired. Do it asynchronously. in ProcessPendingLockRequestUnsafe()
253 // No refs to the instance. We can delete it right now if there are no more lock requests. in DecRefCount()
/commonlibrary/ets_utils/js_api_module/url/
H A Djs_url.cpp269 for (size_t it = 0; it < length; ++it) { in AnalysisPath()
270 auto result = find(g_doubleSegment.begin(), g_doubleSegment.end(), temp[it]); in AnalysisPath()
272 if (path.empty() && it == length - 1) { in AnalysisPath()
280 if (it == length - 1) { in AnalysisPath()
286 result = find(g_singlesegment.begin(), g_singlesegment.end(), temp[it]); in AnalysisPath()
287 if (result != g_singlesegment.end() && it == length - 1) { in AnalysisPath()
293 path.push_back(temp[it]); in AnalysisPath()
315 int it in AnalysisPort() local
802 std::string it = urlinfo.path[0]; AnalysisFilePath() local
1707 HandleIllegalChar(std::wstring& inputStr, std::wstring::const_iterator it) HandleIllegalChar() argument
[all...]
H A Djs_url.h259 * Judge whether it's on or off.
266 * Judge whether it's Ipv6.
354 * method creates it.
407 void HandleIllegalChar(std::wstring& inputStr, std::wstring::const_iterator it);
/commonlibrary/ets_utils/js_concurrent_module/worker/
H A Dworker.cpp1915 std::list<Worker*>::iterator it = std::find(g_workers.begin(), g_workers.end(), worker); in IsValidWorker() local
1916 if (it == g_workers.end()) { in IsValidWorker()
1984 std::list<WorkerListener*>::iterator it = listeners.begin(); in HandleEventListeners() local
1985 while (it != listeners.end()) { in HandleEventListeners()
1986 WorkerListener* data = *it++; in HandleEventListeners()
2106 std::list<WorkerListener*>::iterator it = std::find_if( in AddListenerInner() local
2108 if (it != listenerList.end()) { in AddListenerInner()
2124 std::list<WorkerListener*>::iterator it = in RemoveListenerInner() local
2126 if (it != listenerList.end()) { in RemoveListenerInner()
2127 CloseHelp::DeletePointer(*it, fals in RemoveListenerInner()
2268 std::list<WorkerListener*>::iterator it = std::find_if( ParentPortAddListenerInner() local
2298 std::list<WorkerListener*>::iterator it = ParentPortRemoveListenerInner() local
2323 std::list<WorkerListener*>::iterator it = listeners.begin(); ParentPortHandleEventListeners() local
2439 std::list<Worker*>::iterator it = std::find(g_workers.begin(), g_workers.end(), this); EraseWorker() local
2445 std::list<Worker*>::iterator it = std::find(g_limitedworkers.begin(), g_limitedworkers.end(), this); EraseWorker() local
[all...]
/commonlibrary/ets_utils/js_util_module/util/
H A Djs_uuid.cpp57 auto it = hexMap.find(in); in CharToHex() local
58 if (it != hexMap.end()) { in CharToHex()
59 res = it->second; in CharToHex()
/commonlibrary/ets_utils/js_api_module/buffer/
H A Dconverter.cpp51 // assume it does not exist (if any, not encoded) in Utf8ToUtf16BEToData()
125 for (u16string::const_iterator it = wstr.begin(); it != wstr.end(); ++it) { in Utf16BEToANSI()
126 char16_t wc = (*it); in Utf16BEToANSI()
201 // 4 : paddle the last two bits of the last byte with two zeros in front of it and four zeros after it in Base64Encode()
208 // 2 : paddle the last four bits of the last byte with two zeros in front of it and two zeros after it in Base64Encode()
/commonlibrary/c_utils/base/test/benchmarktest/refbase_benchmark_test/
H A Drefbase_benchmark_test.cpp278 auto it = objects1_.find(descriptor); in QueryObjectInner() local
279 if (it != objects1_.end()) { in QueryObjectInner()
280 it->second->AttemptAcquire(this); in QueryObjectInner()
282 return it->second.GetRefPtr(); in QueryObjectInner()
/commonlibrary/rust/ylong_json/src/
H A Ddeserializer.rs1109 let str_abnormal = r#"{"it":1, "sq" : ["abcd","efgh"],"tp": [1,2,3]"#;

Completed in 20 milliseconds