Home
last modified time | relevance | path

Searched refs:Prepend (Results 1 - 25 of 27) sorted by relevance

12

/third_party/skia/third_party/externals/abseil-cpp/absl/strings/
H A Dcord_ring_test.cc287 return "Prepend"; in ToString()
315 ring = CordRepRing::Prepend(ring, MakeLeaf(flats[i])); in FromFlats()
323 ring = CordRepRing::Prepend(ring, MakeLeaf(flats[--middle1])); in FromFlats()
326 ring = CordRepRing::Prepend(ring, MakeLeaf(flats[middle1 - i])); in FromFlats()
675 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, MakeFlat(str2))); in TEST_P()
801 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2)); in TEST_P()
817 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2)); in TEST_P()
848 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2)); in TEST_P()
863 CordRepRing* result = NeedsUnref(CordRepRing::Prepend(ring, str2, 26)); in TEST_P()
865 result = CordRepRing::Prepend(resul in TEST_P()
[all...]
H A Dcordz_test.cc364 cord().Prepend(src); in TEST_P()
369 cord().Prepend(MakeString(TestCordSize::kSmall)); in TEST_P()
374 cord().Prepend(MakeString(TestCordSize::kLarge)); in TEST_P()
380 cord.Prepend(std::string(Length(GetParam()), '.')); in TEST_P()
388 cord.Prepend(std::string(Length(GetParam()), '.')); in TEST_P()
396 cord.Prepend(std::string(Length(GetParam()), '.')); in TEST_P()
H A Dcord_test.cc667 { // Prepend cord to self in TEST_P()
669 self.Prepend(self); in TEST_P()
703 { // Cord::Prepend(Cord) in TEST_P()
706 x.Prepend(y); in TEST_P()
710 { // Cord::Prepend(absl::string_view) in TEST_P()
712 x.Prepend(b); in TEST_P()
880 concat.Prepend(tmp); in TEST_P()
1525 reused_nodes_cord.Prepend(absl::Cord(std::string(40, 'b')));
1526 reused_nodes_cord.Prepend(absl::Cord(std::string(40, 'a')));
1529 reused_nodes_cord.Prepend(reused_nodes_cor
[all...]
H A Dcord_test_helpers.h109 tmp.Prepend(result); in MakeFragmentedCord()
H A Dcord.cc387 tree = CordRepBtree::Prepend(CordRepBtree::Create(flat), tree); in PrependTreeToInlined()
400 tree = CordRepBtree::Prepend(ForceBtree(data_.as_tree()), tree); in PrependTreeToTree()
812 void Cord::Prepend(const Cord& src) { in Prepend() function in absl::Cord
822 return Prepend(src_contents); in Prepend()
825 void Cord::Prepend(absl::string_view src) { in Prepend() function in absl::Cord
844 inline void Cord::Prepend(T&& src) { in Prepend() function in absl::Cord
846 Prepend(absl::string_view(src)); in Prepend()
853 template void Cord::Prepend(std::string&& src);
H A Dcord.h229 // Cord::Prepend()
233 void Prepend(const Cord& src);
234 void Prepend(absl::string_view src);
236 void Prepend(T&& src);
1226 extern template void Cord::Prepend(std::string&& src);
/third_party/typescript/tests/baselines/reference/
H A DramdaToolsNoInfinite.js33 type Prepend<E, T extends any[]> =
39 0: Drop<N, Tail<T>, Prepend<any, I>>;
53 Prepend<any, I>;
68 0: Reverse<T, Prepend<T[Pos<I>], R>, Next<I>>;
H A DinfiniteConstraints.js41 export type Prepend<Elm, T extends unknown[]> =
49 { 0: [T]; 1: Prepend<T, Conv<ExactExtract<U, T>>>;}[U extends T ? 0 : 1];
H A DramdaToolsNoInfinite2.js231 declare module "List/Prepend" {
234 export type Prepend<L extends List, A extends any> = ((head: A, ...args: L) => any) extends ((...args: infer U) => any) ? U : L;
271 import { Prepend } from "List/Prepend";
283 0: __Reverse<L, Prepend<LO, L[Pos<I>]>, Next<I>>;
309 import { Prepend } from "List/Prepend";
319 0: DropBack<L, N, Prev<I>, Prepend<LN, L[Pos<I>]>>;
/third_party/skia/third_party/externals/dawn/src/common/
H A DSlabAllocator.cpp147 void SlabAllocatorImpl::SentinelSlab::Prepend(SlabAllocatorImpl::Slab* slab) { in Prepend() function in SlabAllocatorImpl::SentinelSlab
186 mFullSlabs.Prepend(slab); in Allocate()
209 mRecycledSlabs.Prepend(slab); in Deallocate()
245 mAvailableSlabs.Prepend(new (alignedPtr) Slab(allocation, node)); in GetNewSlab()
H A DSlabAllocator.h155 void Prepend(Slab* slab);
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_test.cc157 // BtreeAdd returns either CordRepBtree::Append or CordRepBtree::Prepend.
161 : CordRepBtree::Prepend(node, data); in BtreeAdd()
203 : CordRepBtree::Prepend(tree, MakeHexFlat(i)); in MakeTree()
220 while (++rit != flats.rend()) tree = CordRepBtree::Prepend(tree, *rit); in CreateTreeReverse()
394 auto* result = CordRepBtree::Prepend(leaf, flats.front()); in TEST_P()
404 // back of the contained `edges[]` array, alternating Append and Prepend will
417 result = CordRepBtree::Prepend(leaf, flats.front()); in TEST_P()
449 auto* result = CordRepBtree::Prepend(leaf, flat); in TEST_P()
527 tree = CordRepBtree::Prepend(tree, flats.front()); in TEST_P()
539 CordRepBtree* result = CordRepBtree::Prepend(tre in TEST_P()
[all...]
H A Dcord_rep_btree.h43 // 'legs' will have 100% fill ratios for trees built using Append/Prepend
172 // `rep` is merged into `tree` respecting the Append/Prepend order.
177 static CordRepBtree* Prepend(CordRepBtree* tree, CordRep* rep);
179 // Append/Prepend the data in `data` to this tree.
192 static CordRepBtree* Prepend(CordRepBtree* tree, string_view data,
394 // See the `Append/Prepend` function for the meaning and purpose of `extra`.
418 // Fallback functions for `Create()`, `Append()` and `Prepend()` which
451 // See the `Append/Prepend` function for the meaning and purpose of `extra`.
487 // See the `Append/Prepend` function for the meaning and purpose of `extra`.
846 inline CordRepBtree* CordRepBtree::Prepend(CordRepBtre function in absl::cord_internal::CordRepBtree
[all...]
H A Dcord_rep_ring.h180 static CordRepRing* Prepend(CordRepRing* rep, CordRep* child);
188 static CordRepRing* Prepend(CordRepRing* rep, string_view data,
450 // Slow path for Prepend(CordRepRing* rep, CordRep* child). This function is
451 // exercised if the provided `child` in Prepend() is not a leaf node, i.e., a
456 // exercised if the provided `child` in Prepend() is not a leaf node, i.e., a
H A Dcord_rep_ring.cc494 CordRepRing* CordRepRing::Prepend(CordRepRing* rep, CordRep* child) { in Prepend() function in absl::cord_internal::CordRepRing
539 CordRepRing* CordRepRing::Prepend(CordRepRing* rep, absl::string_view data, in Prepend() function in absl::cord_internal::CordRepRing
H A Dcord_rep_btree.cc936 CordRepBtree* CordRepBtree::Prepend(CordRepBtree* tree, absl::string_view data, in Prepend() function in absl::CordRepBtree
/third_party/unity/
H A Dplatformio-build.py15 env.Prepend(CPPPATH=[p])
/third_party/node/deps/v8/src/wasm/
H A Dlocal-decl-encoder.h27 // Prepend local declarations by creating a new buffer and copying data
29 void Prepend(Zone* zone, const byte** start, const byte** end) const;
H A Dlocal-decl-encoder.cc18 void LocalDeclEncoder::Prepend(Zone* zone, const byte** start, in Prepend() function in v8::internal::wasm::LocalDeclEncoder
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
H A DDiagnosticInfo.h631 /// remark. The string \p Prepend will be emitted before the original
633 DiagnosticInfoIROptimization(const char *PassName, StringRef Prepend, in DiagnosticInfoIROptimization() argument
639 *this << Prepend; in DiagnosticInfoIROptimization()
775 /// remark. The string \p Prepend will be emitted before the original
777 OptimizationRemarkAnalysis(const char *PassName, StringRef Prepend, in OptimizationRemarkAnalysis() argument
779 : DiagnosticInfoIROptimization(PassName, Prepend, Orig) {} in OptimizationRemarkAnalysis()
/third_party/protobuf/kokoro/release/python/windows/
H A Dbuild_single_artifact.bat27 REM Prepend newly installed Python to the PATH of this build (this cannot be
/third_party/ffmpeg/ffbuild/
H A Dcommon.mak32 # Prepend to a recursively expanded variable without making it simply expanded.
/third_party/node/deps/v8/tools/debug_helper/
H A Ddebug-helper-internal.h142 void Prepend(const char* prefix) { brief_ = prefix + brief_; } in Prepend() function in v8::internal::debug_helper_internal::ObjectPropertiesResult
H A Dget-object-properties.cc645 result->Prepend("weak ref to "); in GetObjectProperties()
/third_party/node/deps/v8/src/base/
H A Dthreaded-list.h78 void Prepend(ThreadedListBase&& list) { in Prepend() function in v8::base::final

Completed in 40 milliseconds

12