Home
last modified time | relevance | path

Searched defs:erase (Results 151 - 158 of 158) sorted by relevance

1234567

/third_party/libabigail/src/
H A Dabg-dwarf-reader.cc1602 erase(vector<expr_result>::reverse_iterator i) in erase() function in abigail::dwarf::expr_result_stack_type
5456 erase(const offset_pair_type& p) in erase() function
[all...]
/third_party/mesa3d/src/imgui/
H A Dimgui.h1219 inline T* erase(const T* it) { IM_ASSERT(it >= Data && it < Data+Size); const ptrdiff_t off = it - Data; memmove(Data + off, Data + off + 1, ((size_t)Size - (size_t)off - 1) * sizeof(T)); Size--; return Data + off; } in erase() function
1220 inline T* erase(const T* it, const T* it_last){ IM_ASSERT(it >= Data && it < Data+Size && it_last > it && it_last <= Data+Size); const ptrdiff_t count = it_last - it; const ptrdiff_t off = it - Data; memmove(Data + off, Data + off + count, ((size_t)Size - (size_t)off - count) * sizeof(T)); Size -= (int)count; return Data + off; } in erase() function
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DCodeGenPrepare.cpp3007 bool erase(PHINode *Ptr) { in erase() function in __anon23996::PhiNodeSet
[all...]
/third_party/vixl/src/aarch64/
H A Dmacro-assembler-aarch64.h379 void erase(BranchInfo branch_info) { in erase() function in vixl::aarch64::VeneerPool::BranchInfoSet
/kernel/linux/linux-5.10/drivers/scsi/megaraid/
H A Dmegaraid_sas.h519 u32 erase:1; member
536 union MR_PROGRESS erase; member
545 u32 erase:1; member
/kernel/linux/linux-6.6/drivers/scsi/megaraid/
H A Dmegaraid_sas.h521 u32 erase:1; member
538 union MR_PROGRESS erase; member
547 u32 erase:1; member
/third_party/skia/third_party/externals/imgui/
H A Dimgui.h1744 inline T* erase(const T* it) { IM_ASSERT(it >= Data && it < Data + Size); const ptrdiff_t off = it - Data; memmove(Data + off, Data + off + 1, ((size_t)Size - (size_t)off - 1) * sizeof(T)); Size--; return Data + off; } in erase() function
1745 inline T* erase(const T* it, const T* it_last){ IM_ASSERT(it >= Data && it < Data + Size && it_last > it && it_last <= Data + Size); const ptrdiff_t count = it_last - it; const ptrdiff_t off = it - Data; memmove(Data + off, Data + off + count, ((size_t)Size - (size_t)off - count) * sizeof(T)); Size -= (int)count; return Data + off; } in erase() function
/third_party/skia/third_party/vulkanmemoryallocator/include/
H A Dvk_mem_alloc.h5826 void erase(iterator it) { m_RawList.Remove(it.m_pItem); } in erase() function in VmaList

Completed in 84 milliseconds

1234567