Searched refs:first (Results 251 - 275 of 4757) sorted by relevance

<<11121314151617181920>>

/external/tensorflow/tensorflow/cc/framework/
H A Dops.cc29 if (inputs_[i].first == nullptr && inputs_[i].second == -1) {
37 return Output(inputs_[i].first, inputs_[i].second);
71 auto const& first = *v.begin(); local
75 if (e.tensor.dtype() != first.tensor.dtype()) {
81 TensorShape{first.tensor.shape()})) {
90 shape.AppendShape(TensorShape{first.tensor.shape()});
92 Tensor t(first.tensor.dtype(), shape);
98 if (first.tensor.dtype() == DT_STRING) {
/external/libcxx/test/std/re/re.alg/re.alg.match/
H A Dbasic.pass.cpp16 // regex_match(BidirectionalIterator first, BidirectionalIterator last,
46 assert(m.prefix().first == s);
47 assert(m.prefix().second == m[0].first);
49 assert(m.suffix().first == m[0].second);
61 assert(m.prefix().first == s);
62 assert(m.prefix().second == m[0].first);
64 assert(m.suffix().first == m[0].second);
102 assert(m.prefix().first == s);
103 assert(m.prefix().second == m[0].first);
105 assert(m.suffix().first
[all...]
/external/opencv/cv/src/
H A D_cvkdtree.hpp84 int dimension_of_highest_variance(__instype * first, __instype * last, argument
86 assert(last - first > 0);
92 for (__instype * k = first; k < last; ++k)
94 mean /= last - first;
96 for (__instype * k = first; k < last; ++k) {
100 var /= last - first;
113 // given point indices and dimension, find index of median; (almost) modifies [first,last)
114 // such that points_in[first,median]<=point[median], points_in(median,last)>point[median].
117 __instype * median_partition(__instype * first, __instype * last, argument
119 assert(last - first >
140 median_partition(__instype * first, __instype * last, __instype * k, int dim, __valuector ctor) argument
158 insert(__instype * first, __instype * last, __valuector ctor) argument
241 CvKDTree(__valuetype * first, __valuetype * last, int _point_dim, __deref _deref = __deref()) argument
248 CvKDTree(__instype * first, __instype * last, int _point_dim, __valuector ctor, __deref _deref = __deref()) argument
258 set_data(__valuetype * first, __valuetype * last, int _point_dim) argument
262 set_data(__instype * first, __instype * last, int _point_dim, __valuector ctor) argument
[all...]
/external/iproute2/include/
H A Dlist.h84 struct hlist_node *first; member in struct:hlist_head
102 struct hlist_node *first = h->first; local
103 n->next = first;
104 if (first)
105 first->pprev = &n->next;
106 h->first = n;
107 n->pprev = &h->first;
111 for (pos = (head)->first; pos ; pos = pos->next)
115 for (pos = (head)->first; po
[all...]
/external/libtextclassifier/
H A Dcached-features.cc88 click_pos -= extraction_span_.first;
102 selected_span.first -= extraction_span_.first;
103 selected_span.second -= extraction_span_.first;
109 /*intended_span=*/{selected_span.first - config->num_tokens_before(),
110 selected_span.first +
121 /*read_mask_span=*/{selected_span.first, TokenSpanSize(extraction_span_)},
139 for (int i = intended_span.first; i < copy_span.first; ++i) {
144 features_->begin() + copy_span.first * NumFeaturesPerToke
[all...]
/external/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h40 assert(Vector[I->second].first == I->first);
44 assert(!I->first || (Map.count(I->first) &&
45 Map[I->first] == size_t(I - Vector.begin())));
54 Pair.first->second = Num;
58 return Vector[Pair.first->second].second;
63 Map.insert(std::make_pair(InsertPair.first, size_t(0)));
66 Pair.first->second = Num;
70 return std::make_pair(Vector.begin() + Pair.first
[all...]
/external/easymock/src/org/easymock/
H A DEasyMock.java698 * @param first
699 * placeholder for the first expectation.
704 public static boolean and(boolean first, boolean second) { argument
712 * @param first
713 * placeholder for the first expectation.
718 public static byte and(byte first, byte second) { argument
726 * @param first
727 * placeholder for the first expectation.
732 public static char and(char first, char second) { argument
740 * @param first
746 and(double first, double second) argument
760 and(float first, float second) argument
774 and(int first, int second) argument
788 and(long first, long second) argument
802 and(short first, short second) argument
818 and(T first, T second) argument
832 or(boolean first, boolean second) argument
846 or(byte first, byte second) argument
860 or(char first, char second) argument
874 or(double first, double second) argument
888 or(float first, float second) argument
902 or(int first, int second) argument
916 or(long first, long second) argument
930 or(short first, short second) argument
946 or(T first, T second) argument
958 not(boolean first) argument
970 not(byte first) argument
982 not(char first) argument
994 not(double first) argument
1006 not(float first) argument
1018 not(int first) argument
1030 not(long first) argument
1042 not(short first) argument
1056 not(T first) argument
[all...]
/external/ImageMagick/coders/
H A Dfpx.c572 static void ColorTwistMultiply(FPXColorTwistMatrix first,
579 color_twist->byy=(first.byy*second.byy)+(first.byc1*second.bc1y)+
580 (first.byc2*second.bc2y)+(first.dummy1_zero*second.dummy4_zero);
581 color_twist->byc1=(first.byy*second.byc1)+(first.byc1*second.bc1c1)+
582 (first.byc2*second.bc2c1)+(first.dummy1_zero*second.dummy5_zero);
583 color_twist->byc2=(first
566 ColorTwistMultiply(FPXColorTwistMatrix first, FPXColorTwistMatrix second,FPXColorTwistMatrix *color_twist) argument
[all...]
/external/libcxx/test/std/re/re.alg/re.alg.search/
H A Decma.pass.cpp16 // regex_search(BidirectionalIterator first, BidirectionalIterator last,
40 assert(m.prefix().first == s);
41 assert(m.prefix().second == m[0].first);
43 assert(m.suffix().first == m[0].second);
55 assert(m.prefix().first == s);
56 assert(m.prefix().second == m[0].first);
58 assert(m.suffix().first == m[0].second);
77 assert(m.prefix().first == s);
78 assert(m.prefix().second == m[0].first);
80 assert(m.suffix().first
[all...]
/external/emma/core/java12/com/vladium/jcd/lib/
H A DTypes.java46 boolean first = true;
56 if (first)
57 first = false;
76 if (first)
77 first = false;
497 char first = typedescriptor.charAt (0);
499 if (first == '[')
502 else if (first == 'L')
507 return primitive (first);
514 char first
[all...]
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMDefaultBaseTraversers.java254 * @return the first node in the traversal.
256 public int first(int context) method in class:DTMDefaultBaseTraversers.AncestorOrSelfTraverser
271 * @return the first node in the traversal.
273 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AncestorOrSelfTraverser
335 * calling this function, one should first call
382 // System.out.println("Found node via index: "+first);
399 * an axis, the first function must be used to get the first node.
406 * @return the first node in the traversal.
408 public int first(in method in class:DTMDefaultBaseTraversers.ChildTraverser
427 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ChildTraverser
679 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.DescendantTraverser
785 public int first(int context) method in class:DTMDefaultBaseTraversers.DescendantOrSelfTraverser
840 public int first(int context) method in class:DTMDefaultBaseTraversers.FollowingTraverser
878 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingTraverser
1141 public int first(int context) method in class:DTMDefaultBaseTraversers.ParentTraverser
1160 public int first(int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ParentTraverser
1413 public int first(int context) method in class:DTMDefaultBaseTraversers.SelfTraverser
1430 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.SelfTraverser
1477 public int first(int context) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1490 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1564 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.RootTraverser
1638 public int first(int context) method in class:DTMDefaultBaseTraversers.DescendantOrSelfFromRootTraverser
1657 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.DescendantOrSelfFromRootTraverser
1709 public int first(int context) method in class:DTMDefaultBaseTraversers.DescendantFromRootTraverser
1728 public int first(int context, int expandedTypeID) method in class:DTMDefaultBaseTraversers.DescendantFromRootTraverser
[all...]
/external/clang/test/CodeCompletion/
H A Dfunction-templates.cpp3 void sort(RandomAccessIterator first, RandomAccessIterator last);
19 // CHECK-CC1: sort(<#RandomAccessIterator first#>, <#RandomAccessIterator last#>
/external/clang/test/CodeGenCXX/
H A Dpr18635.cpp11 F first; member in struct:unique_ptr::pair
/external/clang/test/Preprocessor/
H A Dc99-6_10_3_4_p9.c15 showlist(The first, second, and third items.);
16 // CHECK: puts("The first, second, and third items.");
/external/compiler-rt/test/asan/TestCases/
H A Dvla_chrome_testcase.cc16 __attribute__((noinline)) void fn3(int *first, int second) { argument
/external/conscrypt/testing/src/main/java/tests/util/
H A DPair.java22 * @param <F> type of the first value.
28 private Pair(F first, S second) { argument
29 mFirst = first;
35 * @param first first value or {@code null}.
38 public static <F, S> Pair<F, S> of(F first, S second) { argument
39 return new Pair<F, S>(first, second);
42 * Gets the first value from this pair.
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/
H A DTensorMeta.h18 const T1& choose(Cond<true>, const T1& first, const T2&) { argument
19 return first;
112 U first; member in struct:Eigen::Tuple
119 Tuple() : first(), second() {}
122 Tuple(const U& f, const V& s) : first(f), second(s) {}
127 first = rhs.first;
135 swap(first, rhs.first);
143 return (x.first
163 Idx first; member in struct:Eigen::IndexPair
[all...]
/external/google-benchmark/src/
H A Dcounter.cc40 auto it = r.find(c.first);
47 auto it = l->find(tc.first);
49 (*l)[tc.first] = tc.second;
60 if (r.find(c.first) == r.end()) {
/external/google-breakpad/src/client/linux/dump_writer_common/
H A Dmapping_info.h52 MappingInfo first; member in struct:google_breakpad::MappingEntry
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/
H A Dmax_element.pass.cpp15 // max_element(Iter first, Iter last);
27 test(Iter first, Iter last) argument
29 Iter i = std::max_element(first, last);
30 if (first != last)
32 for (Iter j = first; j != last; ++j)
H A Dmin_element.pass.cpp15 // min_element(Iter first, Iter last);
27 test(Iter first, Iter last) argument
29 Iter i = std::min_element(first, last);
30 if (first != last)
32 for (Iter j = first; j != last; ++j)
/external/libcxx/test/std/containers/associative/map/map.modifiers/
H A Dinsert_iter_cv.pass.cpp34 assert(r->first == 2);
41 assert(r->first == 1);
48 assert(r->first == 3);
55 assert(r->first == 3);
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/
H A Dinsert_cv.pass.cpp32 assert(r->first == 2);
39 assert(r->first == 1);
46 assert(r->first == 3);
53 assert(r->first == 3);
H A Dinsert_iter_cv.pass.cpp33 assert(r->first == 2);
40 assert(r->first == 1);
47 assert(r->first == 3);
54 assert(r->first == 3);
/external/libcxx/test/std/iterators/iterator.primitives/iterator.operations/
H A Ddistance.pass.cpp14 // distance(Iter first, Iter last);
18 // distance(Iter first, Iter last);
27 test(It first, It last, typename std::iterator_traits<It>::difference_type x) argument
29 assert(std::distance(first, last) == x);
35 constexpr_test(It first, It last, typename std::iterator_traits<It>::difference_type x) argument
37 return std::distance(first, last) == x;

Completed in 2992 milliseconds

<<11121314151617181920>>