| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| constants.rb | 78 # The smallest possible value of non-builtin ANTLR-generated token types
|
| /external/brotli/c/enc/ |
| backward_references_hq.h | 55 /* Smallest cost to get to this byte from the beginning, as found so far. */
|
| /external/google-breakpad/src/processor/ |
| static_contained_range_map.h | 55 // Retrieves the most specific (smallest) descendant range encompassing
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| prime_tables.h | 50 // Returns the smallest prime number greater than p; or returns -1
|
| /external/googletest/googletest/samples/ |
| prime_tables.h | 50 // Returns the smallest prime number greater than p; or returns -1
|
| /external/libbrillo/brillo/message_loops/ |
| fake_message_loop.h | 75 // queue is the lowest (earliest) time, and for the same time, the smallest
|
| /external/libchrome/base/trace_event/ |
| memory_dump_scheduler.h | 37 // at most one. All intervals should be an integeral multiple of the smallest
|
| /external/libvpx/libvpx/vp8/common/ |
| quant_common.c | 109 * The smallest precision for that is '(x*6349) >> 12' but 16 is a good
|
| /external/llvm/docs/HistoricalNotes/ |
| 2000-12-06-MeetingSummary.txt | 80 numbers are the smallest.
|
| /external/llvm/include/llvm/ADT/ |
| DAGDeltaAlgorithm.h | 53 /// changes and returning the smallest set which still satisfies the test
|
| DeltaAlgorithm.h | 86 /// subsets of changes and returning the smallest set which still satisfies
|
| /external/llvm/include/llvm/IR/ |
| ConstantRange.h | 63 /// Produce the smallest range such that all values that may satisfy the given
181 /// Return the smallest unsigned value contained in the ConstantRange.
189 /// Return the smallest signed value contained in the ConstantRange.
212 /// smallest possible set size that does so. Because there may be two
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonTargetObjectFile.cpp | 253 /// discovering the smallest addressable one.
257 // Assign the smallest element access size to the highest
319 // If -mno-sort-sda is not set, find out smallest accessible entity in
323 // declarations - they are currently counted towards smallest addres-
|
| /external/llvm/test/CodeGen/Thumb/ |
| large-stack.ll | 32 ; Smallest stack for which we use a constant pool
|
| /external/llvm/test/Transforms/LoopVectorize/X86/ |
| vector_max_bandwidth.ll | 14 ; Tests that the vectorization factor is determined by the smallest instead of
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_attr_setstack/ |
| 2-1.c | 85 * Use smallest usable stack size for us to be able to call
|
| /external/lzma/Java/Tukaani/src/org/tukaani/xz/ |
| DeltaInputStream.java | 25 * Smallest supported delta calculation distance.
|
| /external/perf_data_converter/src/quipper/ |
| binary_data_utils.h | 76 // Round |value| up to the next |alignment|. I.e. returns the smallest multiple
|
| perf_data_utils.h | 49 // In perf data, strings are packed into the smallest number of 8-byte blocks
|
| /external/protobuf/gtest/samples/ |
| prime_tables.h | 50 // Returns the smallest prime number greater than p; or returns -1
|
| /external/python/cpython2/Lib/lib-tk/test/test_ttk/ |
| test_functions.py | 256 # smallest (after an empty one) acceptable layout
257 smallest = ttk._format_layoutlist([('a', None)], indent=0)
258 self.assertEqual(smallest,
260 self.assertEqual(smallest[0], 'a')
|
| /external/sfntly/cpp/src/sfntly/data/ |
| font_input_stream.h | 35 // FUNIT Smallest measurable distance in the em space.
|
| /external/skia/include/encode/ |
| SkPngEncoder.h | 37 * will encode smallest, then apply that filter. This happens on a per row basis,
|
| /external/skia/tests/ |
| SkGaussFilterTest.cpp | 19 // Sum smallest to largest to retain precision.
|
| /external/skqp/include/encode/ |
| SkPngEncoder.h | 37 * will encode smallest, then apply that filter. This happens on a per row basis,
|
