/external/stlport/test/eh/ |
H A D | random_number.cpp | 26 unsigned random_number( size_t range ) 29 if (range == 0) return 0; 30 return (unsigned)(EH_STD::rand() + EH_STD::rand()) % range; 33 if (range==0) return 0; 34 return rnd(range);
|
H A D | random_number.h | 21 // Return a random number in the given range. 22 unsigned random_number( size_t range );
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | RangeTest.java | 42 Range<Integer> range = Ranges.open(4, 8); 43 checkContains(range); 44 assertTrue(range.hasLowerBound()); 45 assertEquals(4, (int) range.lowerEndpoint()); 46 assertEquals(OPEN, range.lowerBoundType()); 47 assertTrue(range.hasUpperBound()); 48 assertEquals(8, (int) range.upperEndpoint()); 49 assertEquals(OPEN, range.upperBoundType()); 50 assertFalse(range.isEmpty()); 51 assertEquals("(4\u20258)", range 128 checkContains(Range<Integer> range) argument 250 assertUnboundedBelow(Range<Integer> range) argument 264 assertUnboundedAbove(Range<Integer> range) argument [all...] |
H A D | GeneralRangeTest.java | 46 GeneralRange<Integer> range = GeneralRange.range(ORDERING, 4, lboundType, 2, uboundType); 56 GeneralRange.range(ORDERING, i, OPEN, i, OPEN); 64 GeneralRange<Integer> range = GeneralRange.range(ORDERING, i, CLOSED, i, OPEN); 66 assertFalse(range.contains(j)); 73 GeneralRange<Integer> range = GeneralRange.range(ORDERING, i, OPEN, i, CLOSED); 75 assertFalse(range.contains(j)); 82 GeneralRange<Integer> range [all...] |
/external/elfutils/tests/ |
H A D | run-get-aranges.sh | 32 0x804842b: not in range 36 0x804845a: not in range 37 0x804845b: not in range 41 0x8048466: not in range 42 0x8048467: not in range 46 0x8048472: not in range 53 0x804842b: not in range 54 0x804842c: not in range 55 0x804843c: not in range 56 0x8048459: not in range [all...] |
/external/clang/test/CodeGenCXX/ |
H A D | reference-in-blocks.cpp | 5 template<typename T> class range { class 8 range(T i) {_i = i;}; function in class:range 35 void (^bl)(range<int> ) = ^(range<int> i){printf("Hello Blocks %d\n", i.get()); }; 38 void (^bl2)(range<int>& ) = ^(range<int>& i){printf("Hello Blocks %d\n", i.get()); };
|
/external/freetype/src/base/ |
H A D | ftgasp.c | 38 TT_GaspRange range = ttface->gasp.gaspRanges; local 39 TT_GaspRange range_end = range + ttface->gasp.numRanges; 42 while ( ppem > range->maxPPEM ) 44 range++; 45 if ( range >= range_end ) 49 result = range->gaspFlag;
|
/external/webkit/Source/WebCore/inspector/front-end/ |
H A D | TextEditorModel.js | 93 setText: function(range, text) 96 if (!range) { 97 range = new WebInspector.TextRange(0, 0, this._lines.length - 1, this._lines[this._lines.length - 1].length); 100 var command = this._pushUndoableCommand(range); 101 var newRange = this._innerSetText(range, text); 102 command.range = newRange.clone(); 105 this._changeListener(range, newRange, command.text, text); 114 _innerSetText: function(range, text) 116 this._eraseRange(range); 118 return new WebInspector.TextRange(range [all...] |
/external/webkit/Source/WebKit2/WebProcess/InjectedBundle/DOM/ |
H A D | InjectedBundleRangeHandle.cpp | 44 PassRefPtr<InjectedBundleRangeHandle> InjectedBundleRangeHandle::getOrCreate(Range* range) argument 46 if (!range) 49 std::pair<DOMHandleCache::iterator, bool> result = domHandleCache().add(range, 0); 53 RefPtr<InjectedBundleRangeHandle> rangeHandle = InjectedBundleRangeHandle::create(range); 58 PassRefPtr<InjectedBundleRangeHandle> InjectedBundleRangeHandle::create(Range* range) argument 60 return adoptRef(new InjectedBundleRangeHandle(range)); 63 InjectedBundleRangeHandle::InjectedBundleRangeHandle(Range* range) argument 64 : m_range(range)
|
/external/webkit/Tools/DumpRenderTree/qt/ |
H A D | PlainTextControllerQt.cpp | 41 QString PlainTextController::plainText(const QVariant& range) argument 43 return DumpRenderTreeSupportQt::plainText(range);
|
/external/chromium/net/http/ |
H A D | http_byte_range_unittest.cc | 27 net::HttpByteRange range; local 28 range.set_first_byte_position(tests[i].first_byte_position); 29 range.set_last_byte_position(tests[i].last_byte_position); 30 range.set_suffix_length(tests[i].suffix_length); 31 EXPECT_EQ(tests[i].valid, range.IsValid()); 59 net::HttpByteRange range; local 60 range.set_first_byte_position(tests[i].first_byte_position); 61 range.set_last_byte_position(tests[i].last_byte_position); 62 range.set_suffix_length(tests[i].suffix_length); 64 bool return_value = range [all...] |
/external/webkit/Source/WebKit/wx/ |
H A D | WebDOMSelection.cpp | 61 WTF::RefPtr<WebCore::Range> range = m_selection->toNormalizedRange(); local 64 if (range) { 65 range->ref(); 66 return new WebDOMRange(range.get());
|
/external/webkit/Tools/Scripts/webkitpy/style/checkers/ |
H A D | changelog_unittest.py | 67 self.assert_error(1, range(1, 20), 'changelog/bugnumber', 71 self.assert_error(1, range(1, 20), 'changelog/bugnumber', 76 self.assert_error(1, range(1, 20), 'changelog/bugnumber', 81 self.assert_error(1, range(1, 20), 'changelog/bugnumber', 86 self.assert_error(1, range(1, 20), 'changelog/bugnumber', 92 self.assert_error(2, range(2, 5), 'changelog/bugnumber', 99 self.assert_error(2, range(2, 6), 'changelog/bugnumber', 112 ' Example ChangeLog entry out of range\n' 119 self.assert_no_error(range(1, 20), 124 self.assert_no_error(range( [all...] |
/external/skia/tests/ |
H A D | ClampRangeTest.cpp | 49 static void slow_check(const SkClampRange& range, argument 51 SkASSERT(range.fCount0 + range.fCount1 + range.fCount2 == count); 54 if (range.fOverflowed) { 55 fx = range.fFx1; 56 for (i = 0; i < range.fCount1; i++) { 61 for (i = 0; i < range.fCount0; i++) { 63 R_ASSERT(v == range.fV0); 66 if (range 84 SkClampRange range; local [all...] |
/external/webkit/LayoutTests/fast/dom/Selection/script-tests/ |
H A D | getRangeAt.js | 1 description("Test to make sure that getRangeAt does not modify the range when returning it.") 10 var range = sel.getRangeAt(0); variable 12 var result = range.comparePoint(textNode, 0); 14 testPassed("range is correctly (text, 0)"); 16 testFailed("range did not match (text, 0)"); 24 debug("startContainer: " + range.startContainer); 25 debug("startOffset: " + range.startOffset); 26 debug("endContainer: " + range.endContainer); 27 debug("endOffset: " + range.endOffset);
|
/external/libvpx/vp8/decoder/ |
H A D | dboolhuff.h | 34 unsigned int range; member in struct:__anon6907 75 unsigned int range; local 79 range = br->range; 81 split = 1 + (((range - 1) * probability) >> 8); 84 range = split; 88 range = br->range - split; 94 register unsigned int shift = vp8dx_bitreader_norm[range]; 95 range << [all...] |
/external/webkit/Source/WebCore/html/ |
H A D | TimeRanges.h | 82 inline bool isOverlappingRange(const Range& range) const 84 return isPointInRange(range.m_start) || isPointInRange(range.m_end) || range.isPointInRange(m_start); 87 inline bool isContiguousWithRange(const Range& range) const 89 return range.m_start == m_end || range.m_end == m_start; 92 inline Range unionWithOverlappingOrContiguousRange(const Range& range) const 96 ret.m_start = std::min(m_start, range.m_start); 97 ret.m_end = std::max(m_end, range [all...] |
/external/openssl/crypto/bn/ |
H A D | bn_rand.c | 229 /* random number r: 0 <= r < range */ 230 static int bn_rand_range(int pseudo, BIGNUM *r, const BIGNUM *range) argument 236 if (range->neg || BN_is_zero(range)) 242 n = BN_num_bits(range); /* n > 0 */ 244 /* BN_is_bit_set(range, n - 1) always holds */ 248 else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) 250 /* range = 100..._2, 251 * so 3*range ( 297 BN_rand_range(BIGNUM *r, const BIGNUM *range) argument 302 BN_pseudo_rand_range(BIGNUM *r, const BIGNUM *range) argument [all...] |
/external/libsepol/include/sepol/policydb/ |
H A D | context.h | 28 * identity, a role, a type and a MLS range. 34 mls_range_t range; member in struct:context_struct 39 mls_range_init(&c->range); 46 if (mls_range_cpy(&dst->range, &src->range) < 0) 54 return (mls_level_eq(&c1->range.level[0], &c2->range.level[0]) && 55 mls_level_eq(&c1->range.level[1], &c2->range.level[1])); 64 mls_range_destroy(&c->range); [all...] |
/external/clang/lib/ARCMigrate/ |
H A D | Internals.h | 29 bool clearDiagnostic(ArrayRef<unsigned> IDs, SourceRange range); 30 bool hasDiagnostic(ArrayRef<unsigned> IDs, SourceRange range) const; 62 void remove(SourceRange range); 64 void replace(SourceRange range, StringRef text); 65 void replace(SourceRange range, SourceRange replacementRange); 69 void increaseIndentation(SourceRange range, 72 bool clearDiagnostic(ArrayRef<unsigned> IDs, SourceRange range); 73 bool clearAllDiagnostics(SourceRange range) { argument 74 return clearDiagnostic(ArrayRef<unsigned>(), range); 76 bool clearDiagnostic(unsigned ID1, unsigned ID2, SourceRange range) { argument 80 clearDiagnostic(unsigned ID1, unsigned ID2, unsigned ID3, SourceRange range) argument 86 hasDiagnostic(unsigned ID, SourceRange range) argument 90 hasDiagnostic(unsigned ID1, unsigned ID2, SourceRange range) argument [all...] |
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | util.rb | 151 def covers?( range ) 152 range.first >= first or return false 154 range.exclude_end? ? last >= range.last : last > range.last 156 range.exclude_end? ? last.succ >= range.last : last >= range.last 160 def covered_by?( range ) 161 range [all...] |
/external/clang/test/CodeGen/ |
H A D | struct.c | 71 } range; typedef in typeref:struct:__anon3783 72 extern range f6(); 74 range r = f6(); 79 range range1; 80 range range2; 86 range r = p.range1; 89 void f9(range *p) { 90 range r = *p; 93 void f10(range *p) { 94 range [all...] |
/external/libvpx/vp8/encoder/ |
H A D | boolhuff.c | 50 br->range = 255; 81 unsigned int range = br->range; local 96 split = 1 + (((range - 1) * probability) >> 8); 98 range = split; 103 range = br->range - split; 106 shift = norm[range]; 108 range <<= shift; 138 br->range [all...] |
/external/clang/include/clang/Edit/ |
H A D | EditsReceiver.h | 26 virtual void replace(CharSourceRange range, StringRef text) = 0; 28 virtual void remove(CharSourceRange range);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | BstRangeOps.java | 34 * to the specified range. Assumes that the tree satisfies the binary search ordering property 35 * relative to {@code range.comparator()}. 38 BstAggregate<? super N> aggregate, GeneralRange<K> range, @Nullable N root) { 40 checkNotNull(range); 41 if (root == null || range.isEmpty()) { 45 if (range.hasLowerBound()) { 46 total -= totalBeyondRangeToSide(aggregate, range, LEFT, root); 48 if (range.hasUpperBound()) { 49 total -= totalBeyondRangeToSide(aggregate, range, RIGHT, root); 54 // Returns total value strictly to the specified side of the specified range 37 totalInRange( BstAggregate<? super N> aggregate, GeneralRange<K> range, @Nullable N root) argument 55 totalBeyondRangeToSide( BstAggregate<? super N> aggregate, GeneralRange<K> range, BstSide side, @Nullable N root) argument 76 minusRange(GeneralRange<K> range, BstBalancePolicy<N> balancePolicy, BstNodeFactory<N> nodeFactory, @Nullable N root) argument 95 subTreeBeyondRangeToSide(GeneralRange<K> range, BstBalancePolicy<N> balancePolicy, BstNodeFactory<N> nodeFactory, BstSide side, @Nullable N root) argument 126 furthestPath( GeneralRange<K> range, BstSide side, BstPathFactory<N, P> pathFactory, @Nullable N root) argument 138 furthestPath( GeneralRange<K> range, BstSide side, BstPathFactory<N, P> pathFactory, P currentPath) argument 162 beyond(GeneralRange<K> range, @Nullable K key, BstSide side) argument [all...] |