Home
last modified time | relevance | path

Searched full:back (Results 1 – 25 of 8329) sorted by relevance

12345678910>>...334

/external/libtextclassifier/utils/
Dresources_test.cc36 test_resources.locale.back()->language = "en"; in BuildTestResources()
37 test_resources.locale.back()->region = "US"; in BuildTestResources()
39 test_resources.locale.back()->language = "en"; in BuildTestResources()
40 test_resources.locale.back()->region = "GB"; in BuildTestResources()
42 test_resources.locale.back()->language = "de"; in BuildTestResources()
43 test_resources.locale.back()->region = "DE"; in BuildTestResources()
45 test_resources.locale.back()->language = "fr"; in BuildTestResources()
46 test_resources.locale.back()->region = "FR"; in BuildTestResources()
48 test_resources.locale.back()->language = "pt"; in BuildTestResources()
49 test_resources.locale.back()->region = "PT"; in BuildTestResources()
[all …]
Dtokenizer_test.cc67 buffers_.back().data())); in TestingTokenizerProxy()
75 flatbuffers::GetRoot<CodepointRange>(buffers_.back().data())); in TestingTokenizerProxy()
107 config = &configs.back(); in TEST()
113 config = &configs.back(); in TEST()
119 config = &configs.back(); in TEST()
164 config = &configs.back(); in TEST()
186 config = &configs.back(); in TEST()
192 config = &configs.back(); in TEST()
198 config = &configs.back(); in TEST()
237 config = &configs.back(); in TEST()
[all …]
/external/jline/src/src/test/java/jline/
DTestEditLine.java107 b = b.left().right().back(); in testRight()
109 b = b.left().left().left().right().left().back(); in testRight()
118 assertBuffer("This is a est", b = b.back()); in testLeft()
119 assertBuffer("This is aest", b = b.back()); in testLeft()
120 assertBuffer("This is est", b = b.back()); in testLeft()
121 assertBuffer("This isest", b = b.back()); in testLeft()
122 assertBuffer("This iest", b = b.back()); in testLeft()
123 assertBuffer("This est", b = b.back()); in testLeft()
124 assertBuffer("Thisest", b = b.back()); in testLeft()
125 assertBuffer("Thiest", b = b.back()); in testLeft()
[all …]
/external/skqp/gm/
Dconvexpaths.cpp54 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, in makePaths()
56 fPaths.back().lineTo(0, 0); in makePaths()
59 fPaths.back().quadTo(50 * SK_Scalar1, 0, in makePaths()
61 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, in makePaths()
104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0); in makePaths()
107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide); in makePaths()
110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength); in makePaths()
113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide); in makePaths()
118 fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1); in makePaths()
119 fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1); in makePaths()
[all …]
/external/skia/gm/
Dconvexpaths.cpp54 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, in makePaths()
56 fPaths.back().lineTo(0, 0); in makePaths()
59 fPaths.back().quadTo(50 * SK_Scalar1, 0, in makePaths()
61 fPaths.back().quadTo(50 * SK_Scalar1, 100 * SK_Scalar1, in makePaths()
104 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, 0); in makePaths()
107 fPaths.back().lineTo(kLength, kLength * SkIntToScalar(i) / kPtsPerSide); in makePaths()
110 fPaths.back().lineTo(kLength * SkIntToScalar(i) / kPtsPerSide, kLength); in makePaths()
113 fPaths.back().lineTo(0, kLength * SkIntToScalar(i) / kPtsPerSide); in makePaths()
118 fPaths.back().lineTo(98 * SK_Scalar1, 100 * SK_Scalar1); in makePaths()
119 fPaths.back().lineTo(3 * SK_Scalar1, 96 * SK_Scalar1); in makePaths()
[all …]
/external/clang/lib/Format/
DContinuationIndenter.cpp103 !(State.Stack.back().BreakBeforeClosingBrace && in canBreak()
122 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder) in canBreak()
139 return !State.Stack.back().NoLineBreak; in canBreak()
147 if (State.Stack.back().BreakBeforeClosingBrace && in mustBreak()
164 State.Stack.back().BreakBeforeParameter && !Current.isTrailingComment() && in mustBreak()
177 State.Stack.back().BreakBeforeParameter) && in mustBreak()
181 if (Current.is(TT_SelectorName) && State.Stack.back().ObjCSelectorNameFound && in mustBreak()
182 State.Stack.back().BreakBeforeParameter) in mustBreak()
224 State.Stack.back().BreakBeforeParameter) in mustBreak()
227 State.Stack.back().BreakBeforeParameter) { in mustBreak()
[all …]
/external/libunwind/doc/
Dunw_create_addr_space.man35 address\-space and initializes it based on the call\-back routines
38 The call\-back routines are described in detail below. The
52 .SH CALL\-BACK ROUTINES
56 uses a set of call\-back routines to access the
66 The first argument to every call\-back routine is an address\-space
71 call\-back routine, libunwind
79 The synopsis and a detailed description of every call\-back routine
82 .SS CALL\-BACK ROUTINE SYNOPSIS
172 call\-back to
184 is zero if the call\-back does not need to
[all …]
Dunw_create_addr_space.tex20 address-space and initializes it based on the call-back routines
22 The call-back routines are described in detail below. The
31 \section{Call-back Routines}
33 \Prog{Libunwind} uses a set of call-back routines to access the
41 The first argument to every call-back routine is an address-space
44 call-back routine, \Prog{libunwind} sets the \Var{as} argument to the
49 The synopsis and a detailed description of every call-back routine
52 \subsection{Call-back Routine Synopsis}
79 \Prog{Libunwind} invokes the \Func{find\_proc\_info}() call-back to
86 \Var{need\_unwind\_info} is zero if the call-back does not need to
[all …]
/external/cldr/tools/java/org/unicode/cldr/util/data/external/
Dun_member_states_raw.txt13 Back to top
33 Back to top
53 Back to top
62 Back to top
72 Back to top
78 Back to top
92 Back to top
98 Back to top
109 Back to top
115 Back to top
[all …]
/external/apache-commons-compress/src/main/java/org/apache/commons/compress/compressors/lz77support/
DParameters.java26 * The hard-coded absolute minimal length of a back-reference.
41 * determines the maximum offset a back-reference can take. Must
71 * Sets the mininal length of a back-reference.
81 * @param minBackReferenceLength the minimal length of a back-reference found. A
100 * Sets the maximal length of a back-reference.
108 * back-reference found. A value smaller than
121 * Sets the maximal offset of a back-reference.
128 * @param maxOffset maximal offset of a back-reference. A
160 * Sets the "nice length" of a back-reference.
162 …* <p>When a back-references if this size has been found, stop searching for longer back-references…
[all …]
/external/eigen/test/
Dstddeque.cpp25 w.front() = w.back(); in check_stddeque_matrix()
26 VERIFY_IS_APPROX(w.front(), w.back()); in check_stddeque_matrix()
39 v.back() = x; in check_stddeque_matrix()
40 VERIFY_IS_APPROX(v.back(), x); in check_stddeque_matrix()
42 VERIFY_IS_APPROX(v.back(), y); in check_stddeque_matrix()
44 VERIFY_IS_APPROX(v.back(), x); in check_stddeque_matrix()
54 w.front() = w.back(); in check_stddeque_transform()
55 VERIFY_IS_APPROX(w.front(), w.back()); in check_stddeque_transform()
68 v.back() = x; in check_stddeque_transform()
69 VERIFY_IS_APPROX(v.back(), x); in check_stddeque_transform()
[all …]
Dstdlist.cpp25 w.front() = w.back(); in check_stdlist_matrix()
26 VERIFY_IS_APPROX(w.front(), w.back()); in check_stdlist_matrix()
39 v.back() = x; in check_stdlist_matrix()
40 VERIFY_IS_APPROX(v.back(), x); in check_stdlist_matrix()
42 VERIFY_IS_APPROX(v.back(), y); in check_stdlist_matrix()
44 VERIFY_IS_APPROX(v.back(), x); in check_stdlist_matrix()
54 w.front() = w.back(); in check_stdlist_transform()
55 VERIFY_IS_APPROX(w.front(), w.back()); in check_stdlist_transform()
68 v.back() = x; in check_stdlist_transform()
69 VERIFY_IS_APPROX(v.back(), x); in check_stdlist_transform()
[all …]
/external/perfetto/src/traced/probes/ftrace/
Devent_info.cc17 Event* event = &events.back(); in GetStaticEventInfo()
33 Event* event = &events.back(); in GetStaticEventInfo()
42 Event* event = &events.back(); in GetStaticEventInfo()
56 Event* event = &events.back(); in GetStaticEventInfo()
65 Event* event = &events.back(); in GetStaticEventInfo()
74 Event* event = &events.back(); in GetStaticEventInfo()
83 Event* event = &events.back(); in GetStaticEventInfo()
96 Event* event = &events.back(); in GetStaticEventInfo()
112 Event* event = &events.back(); in GetStaticEventInfo()
126 Event* event = &events.back(); in GetStaticEventInfo()
[all …]
/external/swiftshader/third_party/llvm-subzero/lib/Demangle/
DItaniumDemangle.cpp465 if (!db.template_param.back().empty()) { in parse_template_param()
466 for (auto &t : db.template_param.back().front()) in parse_template_param()
484 if (sub < db.template_param.back().size()) { in parse_template_param()
485 for (auto &temp : db.template_param.back()[sub]) in parse_template_param()
512 auto expr = db.names.back().move_full(); in parse_const_cast_expr()
516 db.names.back() = in parse_const_cast_expr()
517 "const_cast<" + db.names.back().move_full() + ">(" + expr + ")"; in parse_const_cast_expr()
538 auto expr = db.names.back().move_full(); in parse_dynamic_cast_expr()
542 db.names.back() = in parse_dynamic_cast_expr()
543 "dynamic_cast<" + db.names.back().move_full() + ">(" + expr + ")"; in parse_dynamic_cast_expr()
[all …]
/external/skqp/src/gpu/
DGrBufferAllocPool.cpp49 GrBuffer* buffer = fBlocks.back().fBuffer.get(); in deleteBlocks()
51 UNMAP_BUFFER(fBlocks.back()); in deleteBlocks()
80 BufferBlock& block = fBlocks.back(); in unmap()
85 this->flushCpuData(fBlocks.back(), flushSize); in unmap()
97 if (!fBlocks.back().fBuffer->isMapped()) { in validate()
101 SkASSERT(fBlocks.empty() || !fBlocks.back().fBuffer->isMapped()); in validate()
139 BufferBlock& back = fBlocks.back(); in makeSpace() local
140 size_t usedBytes = back.fBuffer->gpuMemorySize() - back.fBytesFree; in makeSpace()
147 if (alignedSize <= back.fBytesFree) { in makeSpace()
151 *buffer = back.fBuffer; in makeSpace()
[all …]
/external/grpc-grpc/src/core/lib/slice/
Dslice_buffer.cc87 grpc_slice* back; in grpc_slice_buffer_tiny_add() local
93 back = &sb->slices[sb->count - 1]; in grpc_slice_buffer_tiny_add()
94 if (back->refcount) goto add_new; in grpc_slice_buffer_tiny_add()
95 if ((back->data.inlined.length + n) > sizeof(back->data.inlined.bytes)) in grpc_slice_buffer_tiny_add()
97 out = back->data.inlined.bytes + back->data.inlined.length; in grpc_slice_buffer_tiny_add()
98 back->data.inlined.length = in grpc_slice_buffer_tiny_add()
99 static_cast<uint8_t>(back->data.inlined.length + n); in grpc_slice_buffer_tiny_add()
104 back = &sb->slices[sb->count]; in grpc_slice_buffer_tiny_add()
106 back->refcount = nullptr; in grpc_slice_buffer_tiny_add()
107 back->data.inlined.length = static_cast<uint8_t>(n); in grpc_slice_buffer_tiny_add()
[all …]
/external/universal-tween-engine/java/api/src/aurelienribon/tweenengine/equations/
DBack.java10 public abstract class Back extends TweenEquation { class
11 public static final Back IN = new Back() {
20 return "Back.IN";
24 public static final Back OUT = new Back() {
33 return "Back.OUT";
37 public static final Back INOUT = new Back() {
47 return "Back.INOUT";
55 public Back s(float s) { in s()
/external/mesa3d/src/loader/
Dloader_dri3_helper.c523 * Find an idle back buffer. If there isn't one, then
536 /* Check whether we need to reuse the current back buffer as new back. in dri3_find_back()
644 struct loader_dri3_buffer *back; in loader_dri3_copy_sub_buffer() local
655 back = dri3_find_back_alloc(draw); in loader_dri3_copy_sub_buffer()
656 if (!back) in loader_dri3_copy_sub_buffer()
662 /* Update the linear buffer part of the back buffer in loader_dri3_copy_sub_buffer()
666 back->linear_buffer, in loader_dri3_copy_sub_buffer()
667 back->image, in loader_dri3_copy_sub_buffer()
668 0, 0, back->width, back->height, in loader_dri3_copy_sub_buffer()
673 dri3_fence_reset(draw->conn, back); in loader_dri3_copy_sub_buffer()
[all …]
/external/icu/icu4c/source/layoutex/
DLXUtilities.cpp79 le_int32 front, back; in reverse() local
81 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) { in reverse()
84 array[front] = array[back]; in reverse()
85 array[back] = swap; in reverse()
91 le_int32 front, back; in reverse() local
93 for (front = 0, back = length - 1; front < back; front += 1, back -= 1) { in reverse()
96 array[front] = array[back]; in reverse()
97 array[back] = swap; in reverse()
/external/skia/src/gpu/
DGrBufferAllocPool.cpp97 GrBuffer* buffer = fBlocks.back().fBuffer.get(); in deleteBlocks()
99 UNMAP_BUFFER(fBlocks.back()); in deleteBlocks()
125 BufferBlock& block = fBlocks.back(); in unmap()
132 this->flushCpuData(fBlocks.back(), flushSize); in unmap()
145 const GrBuffer* buffer = fBlocks.back().fBuffer.get(); in validate()
150 const GrBuffer* buffer = fBlocks.back().fBuffer.get(); in validate()
191 BufferBlock& back = fBlocks.back(); in makeSpace() local
192 size_t usedBytes = back.fBuffer->size() - back.fBytesFree; in makeSpace()
199 if (alignedSize <= back.fBytesFree) { in makeSpace()
203 *buffer = back.fBuffer; in makeSpace()
[all …]
/external/spirv-llvm/test/SPIRV/
Dlinkage-types.ll6 ; RUN: llvm-dis < %t.rev.bc | FileCheck %s --check-prefix=BACK-TO-LLVM
17 ; BACK-TO-LLVM: @ae = available_externally addrspace(1) global i32 79, align 4
21 ; BACK-TO-LLVM: @i1 = addrspace(1) global i32 1, align 4
25 ; BACK-TO-LLVM: @i2 = internal addrspace(1) global i32 2, align 4
29 ; BACK-TO-LLVM: @i3 = addrspace(1) global i32 3, align 4
33 ; BACK-TO-LLVM: @i4 = common addrspace(1) global i32 0, align 4
37 ; BACK-TO-LLVM: @i5 = internal addrspace(1) global i32 0, align 4
41 ; BACK-TO-LLVM: @color_table = addrspace(2) constant [2 x i32] [i32 0, i32 1], align 4
45 ; BACK-TO-LLVM: @noise_table = external addrspace(2) constant [256 x i32]
49 ; BACK-TO-LLVM: @w = addrspace(1) constant i32 0, align 4
[all …]
/external/libcxx/test/std/containers/sequences/array/
Dfront_back.pass.cpp13 // reference back(); // constexpr in C++17
15 // const_reference back(); // constexpr in C++14
36 return arr.back() == val; in check_back()
52 C::reference r2 = c.back(); in main()
64 C::const_reference r2 = c.back(); in main()
74 static_assert((std::is_same<decltype(c.back()), T &>::value), ""); in main()
75 static_assert((std::is_same<decltype(cc.back()), const T &>::value), ""); in main()
78 TEST_IGNORE_NODISCARD c.back(); in main()
80 TEST_IGNORE_NODISCARD cc.back(); in main()
90 static_assert((std::is_same<decltype(c.back()), const T &>::value), ""); in main()
[all …]
/external/tensorflow/tensorflow/contrib/ignite/kernels/dataset/
Dignite_binary_object_parser.cc36 out_tensors->back().scalar<uint8>()() = ParseByte(ptr); in Parse()
41 out_tensors->back().scalar<int16>()() = ParseShort(ptr); in Parse()
46 out_tensors->back().scalar<uint16>()() = ParseUnsignedShort(ptr); in Parse()
51 out_tensors->back().scalar<int32>()() = ParseInt(ptr); in Parse()
56 out_tensors->back().scalar<int64>()() = ParseLong(ptr); in Parse()
61 out_tensors->back().scalar<float>()() = ParseFloat(ptr); in Parse()
66 out_tensors->back().scalar<double>()() = ParseDouble(ptr); in Parse()
71 out_tensors->back().scalar<bool>()() = ParseBool(ptr); in Parse()
76 out_tensors->back().scalar<string>()() = ParseString(ptr); in Parse()
81 out_tensors->back().scalar<int64>()() = ParseLong(ptr); in Parse()
[all …]
/external/zlib/src/contrib/ada/
Dzlib-streams.ads32 -- Flush the written data to the back stream,
33 -- all data placed to the compressor is flushing to the Back stream.
39 -- Return total number of bytes read from back stream so far.
51 -- Return total number of bytes written to the back stream.
56 Back : in Stream_Access;
70 -- Data written to the Stream is compressing to the Back stream
71 -- and data read from the Stream is decompressed data from the Back stream.
74 -- Data written to the Stream is decompressing to the Back stream
75 -- and data read from the Stream is compressed data from the Back stream.
100 -- because not all read data from back stream
[all …]
/external/eigen/unsupported/Eigen/CXX11/src/ThreadPool/
DRunQueue.h18 // operations on back of the queue can be done by multiple threads concurrently.
21 // All remote threads operating on the queue back are serialized by a mutex.
87 unsigned back = back_.load(std::memory_order_relaxed); in PushBack() local
88 Elem* e = &array_[(back - 1) & kMask]; in PushBack()
93 back = ((back - 1) & kMask2) | (back & ~kMask2); in PushBack()
94 back_.store(back, std::memory_order_relaxed); in PushBack()
106 unsigned back = back_.load(std::memory_order_relaxed); in PopBack() local
107 Elem* e = &array_[back & kMask]; in PopBack()
114 back_.store(back + 1 + (kSize << 1), std::memory_order_relaxed); in PopBack()
124 unsigned back = back_.load(std::memory_order_relaxed); in PopBackHalf() local
[all …]

12345678910>>...334