Home
last modified time | relevance | path

Searched refs:less (Results 1 – 25 of 780) sorted by relevance

12345678910>>...32

/freebsd/contrib/less/
H A DFREEBSD-upgrade1 1. Download latest less(1) tarball. The homepage of less(1) is at:
2 http://www.greenwoodsoftware.com/less/
3 2. Checkout $FSVN/vendor/less/ into less/
4 3. Extract new code to, say, less/lessv429
5 4. cd less/dist
15 14. Resolve any conflicts that happen in head/contrib/less.
19 16. Manually merge changes into src/usr.bin/less/defines.h; adjust
21 17. Replace your src/contrib/less with the merged copy, and do a ``make
H A DREADME10 This is the source code distribution of "less".
22 Please report any problems at https://github.com/gwsw/less/issues.
23 See https://greenwoodsoftware.com/less for the latest info.
24 Source repository is at https://github.com/gwsw/less.git.
29 ONLY IF you are doing development on the less source itself.
30 If you are merely using less as a tool, you should download a release
33 The formatted manual page is in less.man.
34 The manual page nroff source is in less.nro.
46 zip file with a name like less-999.tar.gz or less-999.zip downloaded
61 Specifies the regular expression library used by less for pattern
[all …]
H A DNEWS2 NEWS about less
6 For the latest news about less, see https://greenwoodsoftware.com/less
7 You can also download the latest version of less from there.
10 https://github.com/gwsw/less/issues.
14 Major changes between "less" versions 691 and 692
35 Major changes between "less" versions 685 and 691
60 This reverts to behavior that existed before less-670 (github #700).
97 Major changes between "less" versions 679 and 685
130 in da2a9ecdf16beb642d0c030e35f0351c5f2e5a12 and released in less-673.
136 Major changes between "less" versions 678 and 679
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dordering.h59 static const partial_ordering less;
110 return __v < 0 ? partial_ordering::greater : (__v > 0 ? partial_ordering::less : __v);
117 inline constexpr partial_ordering partial_ordering::less(_PartialOrdResult::__less);
128 static const weak_ordering less;
134 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); in partial_ordering()
181 return __v < 0 ? weak_ordering::greater : (__v > 0 ? weak_ordering::less : __v);
188 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
198 static const strong_ordering less;
206 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); in partial_ordering()
210 …return __value_ == 0 ? weak_ordering::equivalent : (__value_ < 0 ? weak_ordering::less : weak_orde… in weak_ordering()
[all …]
H A Dweak_order.h50 if (__po == partial_ordering::less) { in __go()
51 return weak_ordering::less; in __go()
65 return __t_is_negative ? weak_ordering::less : weak_ordering::greater; in __go()
67 return __u_is_negative ? weak_ordering::greater : weak_ordering::less; in __go()
/freebsd/usr.bin/less/
H A DMakefile2 PROG= less
12 LINKS= ${BINDIR}/less ${BINDIR}/more \
17 MLINKS= less.1 more.1
18 CLEANFILES= less.1
H A DMakefile.common1 LSDIR= ${SRCTOP}/contrib/less
4 CFLAGS+=-I${SRCTOP}/usr.bin/less -I${LSDIR}
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Dset
H A Dmap
/freebsd/contrib/llvm-project/libcxx/src/
H A Dalgorithm.cpp25 ranges::less, in __sort()
27 …__use_branchless_sort<ranges::less, RandomAccessIterator>>(first, last, ranges::less{}, depth_limi… in __sort()
/freebsd/tools/tools/nanobsd/rescue/Files/root/
H A D.cshrc10 a lm 'll | less'
11 a m less
16 setenv PAGER less
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Dalgorithm49 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> …
53 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> …
57 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
131 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
135 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
139 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
145 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
149 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
153 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_min.h41 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
52 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
62 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_max.h42 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
53 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
65 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_is_sorted.h38 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
46 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_min_element.h40 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
48 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_lower_bound.h44 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
53 …ndirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
/freebsd/contrib/llvm-project/libcxx/include/__fwd/
H A Dset.h22 template <class _Key, class _Compare = less<_Key>, class _Allocator = allocator<_Key> >
25 template <class _Key, class _Compare = less<_Key>, class _Allocator = allocator<_Key> >
H A Dmap.h23 template <class _Key, class _Tp, class _Compare = less<_Key>, class _Allocator = allocator<pair<con…
26 template <class _Key, class _Tp, class _Compare = less<_Key>, class _Allocator = allocator<pair<con…
/freebsd/usr.sbin/bsdconfig/includes/
H A DUSAGE48 View functions with less(1) (function names are not highlighted):
50 bsdconfig @PROGRAM_NAME@ -f | less
52 View functions with less(1) and color:
54 bsdconfig @PROGRAM_NAME@ -af | less -R
/freebsd/contrib/llvm-project/libcxx/include/
H A Dalgorithm52 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> …
56 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> …
60 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less>
64 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
134 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
138 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
142 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
148 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
152 indirect_strict_weak_order<projected<const T*, Proj>> Comp = ranges::less>
156 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
[all …]
/freebsd/sys/compat/linuxkpi/common/include/linux/
H A Drbtree.h180 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add_cached()
188 if (less(node, parent)) { in rb_add_cached()
204 bool (*less)(struct rb_node *, const struct rb_node *)) in rb_add()
211 if (less(node, parent)) { in rb_add()
/freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/
H A Dglue_algorithm_impl.h
/freebsd/contrib/ntp/html/hints/
H A Dsgi9 less than 0.017 seconds generally complete in less than a second,
27 Strange. Anyway, since adjtime will complete adjustments of less than
28 17msec in less than a second, whether the fast clock is on or off, I
/freebsd/contrib/unifdef/tests/
H A Dif5.c51 #error FOOB is less than FOO
63 #error FOOB is less than or equal FOO

12345678910>>...32