Searched full:less (Results 1 – 25 of 4778) sorted by relevance
12345678910>>...192
... .less Font-Awesome-4.7.0/less/bordered-pulled.less Font-Awesome-
1 …less/normalize.less","less/print.less","bootstrap.css","dist/css/bootstrap.css","less/glyphicons.l…
5 * Lock-less NULL terminated single linked list66 * init_llist_head - initialize lock-less list head67 * @head: the head for your lock-less list101 * llist_for_each - iterate over some deleted entries of a lock-less list105 * In general, some entries of the lock-less list can be traversed109 * If being used on entries deleted from lock-less list directly, the118 * llist_for_each_safe - iterate over some deleted entries of a lock-less list124 * In general, some entries of the lock-less list can be traversed128 * If being used on entries deleted from lock-less list directly, the137 * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type[all …]
51 * @less: used for insertion; provides the (partial) order between two elements.56 * comp(a->key,b) < 0 := less(a,b)57 * comp(a->key,b) > 0 := less(b,a)58 * comp(a->key,b) == 0 := !less(a,b) && !less(b,a)65 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b); member77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()89 if (less(ltn, ltp)) in __lt_insert()149 __lt_insert(node, root, 0, ops->less); in latch_tree_insert()151 __lt_insert(node, root, 1, ops->less); in latch_tree_insert()
2 DESCRIPTION = "Less is a program similar to more, i.e. a terminal \4 programs. Less offers many features beyond those that more does."8 # (GPL-2.0-or-later (<< 418), GPL-3.0-or-later (>= 418)) | less16 # Using a generic BSD license for less is fine with me.34 UPSTREAM_CHECK_URI = "http://www.greenwoodsoftware.com/less/download.html"42 ALTERNATIVE:${PN} = "less"
252 QVERIFY2(testObj2 < testObj, "Less than operator is not correct for mapId"); in lessThanOperatorTest()255 QVERIFY2(testObj2 < testObj, "Less than operator is not correct for zoom"); in lessThanOperatorTest()258 QVERIFY2(testObj2 < testObj, "Less than operator is not correct for x"); in lessThanOperatorTest()261 QVERIFY2(testObj2 < testObj, "Less than operator is not correct for y"); in lessThanOperatorTest()263 // less than comparisons are done in the order: plugin -> mapId -> zoom -> x -> y in lessThanOperatorTest()266 QVERIFY2(testObj < testObj3, "Order of less than operator is not correct"); in lessThanOperatorTest()268 QVERIFY2(testObj < testObj4, "Order of less than operator is not correct"); in lessThanOperatorTest()270 QVERIFY2(testObj < testObj5, "Order of less than operator is not correct"); in lessThanOperatorTest()272 QVERIFY2(testObj < testObj6, "Order of less than operator is not correct"); in lessThanOperatorTest()274 QVERIFY2(testObj < testObj7, "Order of less than operator is not correct"); in lessThanOperatorTest()[all …]
27 // TODO: Integrate it with geometry::less?33 struct less struct44 return less<Point1, Point2, I + 1, D>::apply(left, right); in apply()54 struct less<Point1, Point2, D, D> struct69 struct less struct74 return detail_dispatch::relate::less<Point1, Point2>::apply(point1, point2); in operator ()()
52 * @param _Compare the comparator to use, defaults to std::less<_Tp>197 // Left one is less or equal. in __init_winner()203 // Right one is less. in __init_winner()297 // Left one is less or equal. in __init_winner()303 // Right one is less. in __init_winner()374 _Compare __comp = std::less<_Tp>())418 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>())436 // Left one is less or equal. in __init_winner()442 // Right one is less. in __init_winner()500 _LoserTreePointer(unsigned int __k, _Compare __comp = std::less<_Tp>())[all …]
30 default. If present, values must be specified less than or equal31 to the number of input signals. If values less than the number of49 should be less than or equal to the number of outputs, if less values64 of values should be less than or equal to the number of inputs,79 be handled normally. If present, number of cells must be less than80 or equal to the number of AIFs. If less than the number of AIFs, for
29 andi $r2, $r2, #3 ! How many bytes are less than a word31 beqz $p1, byte_cpy ! When n is less than a word44 andi $r2, $r2, #3 ! How many bytes are less than a word46 beqz $p1, reverse_byte_cpy ! When n is less than a word58 byte_cpy: ! Less than 4 bytes to copy now
3 # less8 LESS_SITE = http://www.greenwoodsoftware.com/less15 $(INSTALL) -m 0755 $(@D)/less $(TARGET_DIR)/usr/bin/less
71 * Returns an integer less than, equal to, or greater than zero if the72 * first |n| bytes of |src1| is found, respectively, to be less than,80 * Return an integer less than, equal to, or greater than zero if |s1|81 * is found, respectively, to be less than, to match, or be greater88 * Return an integer less than, equal to, or greater than zero if the89 * first |n| bytes of |s1| is found, respectively, to be less than,
139 ,class Compare = std::less<Key>145 ,class Compare = std::less<Key>152 ,class Compare = std::less<Key>159 ,class Compare = std::less<Key>165 ,class Compare = std::less<Key>170 ,class Compare = std::less<Key>176 ,class Compare = std::less<Key>182 ,class Compare = std::less<Key>
1841 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1854 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1869 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1882 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1897 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1910 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1925 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1938 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY()1955 _Comp = ranges::less> in _GLIBCXX_VISIBILITY()1976 _Comp = ranges::less> in _GLIBCXX_VISIBILITY()[all …]
100 * of the compressed xattr id blocks. Each entry should be less than in squashfs_read_xattr_id_table()102 * should be SQUASHFS_METADATA_SIZE or less. table[indexes - 1] in squashfs_read_xattr_id_table()103 * should be less than table_start, and again the difference in squashfs_read_xattr_id_table()104 * shouls be SQUASHFS_METADATA_SIZE or less. in squashfs_read_xattr_id_table()106 * Finally xattr_table_start should be less than table[0]. in squashfs_read_xattr_id_table()
53 enum class _Ord : type { equivalent = 0, less = -1, greater = 1 };65 // less=0xff, equiv=0x00, greater=0x01, unordered=0x0283 static const partial_ordering less;144 partial_ordering::less(__cmp_cat::_Ord::less);167 static const weak_ordering less;225 weak_ordering::less(__cmp_cat::_Ord::less);244 static const strong_ordering less;306 strong_ordering::less(__cmp_cat::_Ord::less);547 return weak_ordering::less;564 return weak_ordering::less;[all …]
9 // Preprocessed version of "boost/mpl/less.hpp" header67 struct less struct74 BOOST_MPL_AUX_LAMBDA_SUPPORT(2, less, (N1, N2))78 BOOST_MPL_AUX_NA_SPEC2(2, 2, less)
9 // *Preprocessed* version of the main "less.hpp" header67 struct less struct74 BOOST_MPL_AUX_LAMBDA_SUPPORT(2, less, (N1, N2))78 BOOST_MPL_AUX_NA_SPEC2(2, 2, less)