Home
last modified time | relevance | path

Searched defs:first (Results 101 – 125 of 31147) sorted by relevance

12345678910>>...1246

/dports/mail/neomutt/neomutt-20211029/test/list/
H A Dmutt_list_compare.c44 struct ListHead first = STAILQ_HEAD_INITIALIZER(first); in test_mutt_list_compare() local
51 struct ListHead first = test_list_create(names, false); in test_mutt_list_compare() local
60 struct ListHead first = test_list_create(first_names, false); in test_mutt_list_compare() local
70 struct ListHead first = test_list_create(first_names, false); in test_mutt_list_compare() local
80 struct ListHead first = test_list_create(first_names, false); in test_mutt_list_compare() local
90 struct ListHead first = test_list_create(first_names, false); in test_mutt_list_compare() local
100 struct ListHead first = test_list_create(first_names, false); in test_mutt_list_compare() local
110 struct ListHead first = test_list_create(first_names, false); in test_mutt_list_compare() local
/dports/math/libsemigroups/libsemigroups-1.3.7/tests/
H A Dtest-wilo.cpp86 word_type first = {0}; variable
113 word_type first = {}; variable
130 word_type first = {}; variable
145 word_type first = {}; variable
165 word_type first = {}; variable
203 word_type first = {0, 1, 2, 3}; variable
221 word_type first = {0, 1}; variable
233 word_type first = {0, 0, 0}; variable
/dports/devel/ctre/compile-time-regular-expressions-3.4.1/include/ctre/
H A Dfirst.hpp13 constexpr auto first(ctll::list<Content...> l, ctll::list<>) noexcept { in first() function
18 constexpr auto first(ctll::list<Content...> l, ctll::list<accept, Tail...>) noexcept { in first() function
23 constexpr auto first(ctll::list<Content...> l, ctll::list<end_mark, Tail...>) noexcept { in first() function
28 constexpr auto first(ctll::list<Content...> l, ctll::list<end_cycle_mark, Tail...>) noexcept { in first() function
38 constexpr auto first(ctll::list<Content...> l, ctll::list<numeric_mark<Id>, Tail...>) noexcept { in first() function
44 constexpr auto first(ctll::list<Content...> l, ctll::list<empty, Tail...>) noexcept { in first() function
91 constexpr auto first(ctll::list<Content...> l, ctll::list<plus<Seq...>, Tail...>) noexcept { in first() function
200 constexpr auto first(ctll::list<Content...> l, ctll::list<string<>, Tail...>) noexcept { in first() function
222 constexpr auto first(ctll::list<Content...> l, ctll::list<select<>, Tail...>) noexcept { in first() function
261 constexpr auto first(ctll::list<Content...>, ctll::list<any, Tail...>) noexcept { in first() function
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/math/statistics/
H A Dunivariate_statistics.hpp67 inline auto mean(ForwardIterator first, ForwardIterator last) in mean()
116 inline auto variance(ForwardIterator first, ForwardIterator last) in variance()
142 inline auto sample_variance(ForwardIterator first, ForwardIterator last) in sample_variance()
310 inline auto skewness(ForwardIterator first, ForwardIterator last) in skewness()
341 inline auto kurtosis(ForwardIterator first, ForwardIterator last) in kurtosis()
365 inline auto excess_kurtosis(ForwardIterator first, ForwardIterator last) in excess_kurtosis()
405 inline auto median(RandomAccessIterator first, RandomAccessIterator last) in median()
689 inline auto mode(ForwardIterator first, ForwardIterator last) in mode()
965 Real median(RandomAccessIterator first, RandomAccessIterator last) in median()
1094 Real interquartile_range(ForwardIterator first, ForwardIterator last) in interquartile_range()
[all …]
/dports/audio/clementine-player/Clementine-1.4.0rc1/3rdparty/libprojectm/omptl/
H A Domptl_algorithm_ser.h51 OutputIterator copy(InputIterator first, InputIterator last, in copy()
58 BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, in copy_backward()
75 void count(InputIterator first, InputIterator last, in count()
83 count_if(InputIterator first, InputIterator last, Predicate pred, in count_if()
90 void count_if(InputIterator first, InputIterator last, in count_if()
136 OutputIterator fill_n(OutputIterator first, Size n, const T& value, in fill_n()
143 InputIterator find(InputIterator first, InputIterator last, in find()
150 InputIterator find_if(InputIterator first, InputIterator last, in find_if()
544 OutputIterator reverse_copy(BidirectionalIterator first, in reverse_copy()
690 void sort(RandomAccessIterator first, RandomAccessIterator last, in sort()
[all …]
/dports/graphics/libprojectm/projectm-3.1.12/src/libprojectM/omptl/
H A Domptl_algorithm_ser.h51 OutputIterator copy(InputIterator first, InputIterator last, in copy()
58 BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, in copy_backward()
75 void count(InputIterator first, InputIterator last, in count()
83 count_if(InputIterator first, InputIterator last, Predicate pred, in count_if()
90 void count_if(InputIterator first, InputIterator last, in count_if()
136 OutputIterator fill_n(OutputIterator first, Size n, const T& value, in fill_n()
143 InputIterator find(InputIterator first, InputIterator last, in find()
150 InputIterator find_if(InputIterator first, InputIterator last, in find_if()
544 OutputIterator reverse_copy(BidirectionalIterator first, in reverse_copy()
690 void sort(RandomAccessIterator first, RandomAccessIterator last, in sort()
[all …]
/dports/biology/mmseqs2/MMseqs2-13-45111/lib/omptl/
H A Domptl_algorithm_ser.h51 OutputIterator copy(InputIterator first, InputIterator last, in copy()
58 BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, in copy_backward()
73 void count(InputIterator first, InputIterator last, in count()
81 count_if(InputIterator first, InputIterator last, Predicate pred, in count_if()
88 void count_if(InputIterator first, InputIterator last, in count_if()
134 OutputIterator fill_n(OutputIterator first, Size n, const T& value, in fill_n()
141 InputIterator find(InputIterator first, InputIterator last, in find()
148 InputIterator find_if(InputIterator first, InputIterator last, in find_if()
533 OutputIterator reverse_copy(BidirectionalIterator first, in reverse_copy()
679 void sort(RandomAccessIterator first, RandomAccessIterator last, in sort()
[all …]
/dports/math/ump/ump-0.8.6/src/
H A Dmath2.variablelist.cpp44 intern_variablelist *src_first = src.varlist, *first; in operator =() local
75 intern_variablelist *first = varlist; in get_id() local
94 intern_variablelist *first = varlist; in check_for() local
113 intern_variablelist *first = varlist; in get_pointer_rw() local
125 intern_variablelist *first = varlist; in get_pointer() local
137 intern_variablelist *first = varlist; in get_highest_idnr() local
150 intern_variablelist *first = varlist; in make_undeletable() local
165 intern_variablelist *first = varlist; in get_deletable() local
177 intern_variablelist *first = varlist; in remove() local
215 intern_variablelist *first = varlist; in set_all_to_unused() local
[all …]
/dports/devel/fbthrift/fbthrift-2021.12.27.00/thrift/test/php/
H A DTestClient.php173 $first = true; variable
176 $first = false; variable
186 $first = true; variable
189 $first = false; variable
205 $first = true; variable
208 $first = false; variable
217 $first = true; variable
220 $first = false; variable
236 $first = true; variable
239 $first = false; variable
[all …]
/dports/graphics/appleseed/appleseed-2.1.0-beta/src/appleseed/foundation/math/
H A Dcombination.h168 bool next_partial_permutation(BidirectionalIterator first, in next_partial_permutation()
233 bool next_combination(BidirectionalIterator first, in next_combination()
241 bool next_combination(BidirectionalIterator first, in next_combination()
263 bool prev_combination(BidirectionalIterator first, in prev_combination()
272 bool prev_combination(BidirectionalIterator first, in prev_combination()
294 next_mapping(BidirectionalIterator first, in next_mapping()
312 next_mapping(BidirectionalIterator first, in next_mapping()
343 prev_mapping(BidirectionalIterator first, in prev_mapping()
363 prev_mapping(BidirectionalIterator first, in prev_mapping()
390 next_combination_counts(BidirectionalIterator first, in next_combination_counts()
[all …]
/dports/math/cgal/CGAL-5.3/include/CGAL/
H A Dpartition_2.h28 OutputIterator greene_approx_convex_partition_2(InputIterator first, in greene_approx_convex_partition_2()
38 OutputIterator greene_approx_convex_partition_2(InputIterator first, in greene_approx_convex_partition_2()
47 OutputIterator optimal_convex_partition_2(InputIterator first, in optimal_convex_partition_2()
57 OutputIterator optimal_convex_partition_2(InputIterator first, in optimal_convex_partition_2()
66 OutputIterator approx_convex_partition_2(InputIterator first, in approx_convex_partition_2()
76 OutputIterator approx_convex_partition_2(InputIterator first, in approx_convex_partition_2()
85 OutputIterator y_monotone_partition_2(InputIterator first, in y_monotone_partition_2()
95 OutputIterator y_monotone_partition_2(InputIterator first, in y_monotone_partition_2()
/dports/security/py-certbot-apache/certbot-apache-1.22.0/certbot_apache/_internal/
H A Dassertions.py9 def assertEqual(first, second): argument
33 def assertEqualComment(first, second): # pragma: no cover argument
43 def _assertEqualDirectiveComponents(first, second): # pragma: no cover argument
56 def assertEqualDirective(first, second): argument
112 def assertEqualSimple(first, second): argument
118 def isEqualVirtualHost(first, second): argument
139 def assertEqualPathsList(first, second): # pragma: no cover argument
/dports/devel/boost-python-libs/boost_1_72_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/devel/boost-docs/boost_1_72_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/databases/percona57-server/boost_1_59_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/databases/xtrabackup/boost_1_59_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/databases/percona57-client/boost_1_59_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/devel/boost-libs/boost_1_72_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/devel/hyperscan/boost_1_75_0/libs/iostreams/test/
H A Darray_test.cpp31 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
41 stream<array_source> first(&seq[0], &seq[0] + seq.size()); in array_test() local
52 vector<char> first(data_reps * data_length(), '?'); in array_test() local
63 vector<char> first(data_reps * data_length(), '?'); in array_test() local
76 vector<char> first(data_reps * data_length(), '?'); in array_test() local
85 vector<char> first(data_reps * data_length(), '?'); in array_test() local
/dports/devel/eastl/EASTL-3.13.06/include/EASTL/
H A Dsort.h108 inline bool is_sorted(ForwardIterator first, ForwardIterator last) in is_sorted()
130 ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last) in is_sorted_until()
259 void insertion_sort(BidirectionalIterator first, BidirectionalIterator last) in insertion_sort()
412 inline void shell_sort(RandomAccessIterator first, RandomAccessIterator last) in shell_sort()
436 inline void heap_sort(RandomAccessIterator first, RandomAccessIterator last) in heap_sort()
1085 void quick_sort(RandomAccessIterator first, RandomAccessIterator last) in quick_sort()
1693 void radix_sort_impl(RandomAccessIterator first, in radix_sort_impl()
1839 inline void comb_sort(ForwardIterator first, ForwardIterator last) in comb_sort()
1917 inline void bubble_sort(ForwardIterator first, ForwardIterator last) in bubble_sort()
1943 inline void sort(RandomAccessIterator first, RandomAccessIterator last) in sort()
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/stl_interfaces/test/
H A Drandom_access.cpp606 random_access first(ints.data()); in main() local
627 random_access first(ints.data()); in main() local
670 random_access first(ints.data()); in main() local
677 random_access first(ints.data()); in main() local
714 random_access first(ints.data()); in main() local
760 random_access first(ints.data()); in main() local
781 random_access first(iota_ints.data()); in main() local
789 random_access first(iota_ints.data()); in main() local
801 random_access first(iota_ints.data()); in main() local
814 const_random_access first(ints.data()); in main() local
[all …]
/dports/net/libyang/libyang-1.0.240/src/
H A Dprinter_info.c31 int first = 1; in info_print_text() local
222 int i, j, first = 1; in info_print_typedef_with_include() local
470 int first = 1, i, j; in info_print_import_with_include() local
509 int first = 1, i; in info_print_include() local
530 int first = 1, i; in info_print_augment() local
551 int first = 1, i; in info_print_deviation() local
572 int first = 1, i, j; in info_print_ident_with_include() local
609 int first = 1, i, j; in info_print_features_with_include() local
646 int first = 1, from_include; in info_print_data_mainmod_with_include() local
837 info_print_leaf(struct lyout *out, const struct lys_node *node, int *UNUSED(first)) in info_print_leaf()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/geometry/index/detail/
H A Dminmax_heap.hpp183 inline void push_heap(It first, It last, Compare comp) in push_heap()
333 inline void make_heap(It first, It last, Compare comp) in make_heap()
366 inline bool is_heap(It first, It last, Compare comp) in is_heap()
418 inline It bottom_heap(It first, It last, Compare comp) in bottom_heap()
437 inline void push_minmax_heap(It first, It last) in push_minmax_heap()
451 inline void pop_top_minmax_heap(It first, It last) in pop_top_minmax_heap()
466 inline void pop_bottom_minmax_heap(It first, It last) in pop_bottom_minmax_heap()
482 inline void make_minmax_heap(It first, It last) in make_minmax_heap()
489 inline bool is_minmax_heap(It first, It last, Compare comp) in is_minmax_heap()
496 inline bool is_minmax_heap(It first, It last) in is_minmax_heap()
[all …]

12345678910>>...1246