Home
last modified time | relevance | path

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

12345678910>>...29

/freebsd-14.2/contrib/less/
H A DFREEBSD-upgrade3 1. Download latest less(1) tarball. The homepage of less(1) is at:
4 http://www.greenwoodsoftware.com/less/
5 2. Checkout $FSVN/vendor/less/ into less/
6 3. Extract new code to, say, less/lessv429
7 4. cd less/dist
17 14. Resolve any conflicts that happen in head/contrib/less.
21 16. Manually merge changes into src/usr.bin/less/defines.h; adjust
23 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".
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.
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
72 (source is supplied with less).
91 wish to edit the manual page "less.nro" and the help page "less.hlp"
97 6. If the make succeeds, it will generate the programs "less",
[all …]
H A DNEWS2 NEWS about less
6 For the latest news about less, see https://greenwoodsoftware.com/less
10 https://github.com/gwsw/less/issues.
14 Major changes between "less" versions 633 and 643
45 Major changes between "less" versions 632 and 633
52 Major changes between "less" versions 608 and 632
207 after exiting less.
660 invocations of less.
673 build a secure version of less.
876 See the less man page or "less --help" for the list of long option names.
[all …]
/freebsd-14.2/contrib/llvm-project/libcxx/include/__compare/
H A Dordering.h56 static const partial_ordering less;
107 return __v < 0 ? partial_ordering::greater : (__v > 0 ? partial_ordering::less : __v);
114 inline constexpr partial_ordering partial_ordering::less(_OrdResult::__less);
125 static const weak_ordering less;
131 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); in partial_ordering()
178 return __v < 0 ? weak_ordering::greater : (__v > 0 ? weak_ordering::less : __v);
185 inline constexpr weak_ordering weak_ordering::less(_OrdResult::__less);
195 static const strong_ordering less;
203 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); in partial_ordering()
256 return __v < 0 ? strong_ordering::greater : (__v > 0 ? strong_ordering::less : __v);
[all …]
H A Dweak_order.h46 if (__po == partial_ordering::less) { in __go()
47 return weak_ordering::less; in __go()
61 return __t_is_negative ? weak_ordering::less : weak_ordering::greater; in __go()
63 return __u_is_negative ? weak_ordering::greater : weak_ordering::less; in __go()
H A Dcompare_strong_order_fallback.h44 ? strong_ordering::less
48 ? strong_ordering::less
52 ? strong_ordering::less
H A Dcompare_weak_order_fallback.h44 ? weak_ordering::less
48 ? weak_ordering::less
52 ? weak_ordering::less
H A Dcompare_partial_order_fallback.h43 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
48 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
53 : std::forward<_Tp>(__t) < std::forward<_Up>(__u) ? partial_ordering::less
/freebsd-14.2/usr.bin/less/
H A DMakefile3 PROG= less
13 LINKS= ${BINDIR}/less ${BINDIR}/more \
18 MLINKS= less.1 more.1
19 CLEANFILES= less.1
H A DMakefile.common2 LSDIR= ${SRCTOP}/contrib/less
5 CFLAGS+=-I${SRCTOP}/usr.bin/less -I${LSDIR}
/freebsd-14.2/contrib/llvm-project/libcxx/src/
H A Dalgorithm.cpp22 ranges::less, in __sort()
24 __use_branchless_sort<ranges::less, RandomAccessIterator>::value>( in __sort()
25 first, last, ranges::less{}, depth_limit); in __sort()
/freebsd-14.2/sys/contrib/device-tree/Bindings/sound/
H A Dwlf,arizona.yaml33 default. If present, values must be specified less than or equal
34 to the number of input signals. If values less than the number of
52 should be less than or equal to the number of outputs, if less values
67 of values should be less than or equal to the number of inputs,
82 be handled normally. If present, number of cells must be less than
83 or equal to the number of AIFs. If less than the number of AIFs, for
/freebsd-14.2/tools/tools/nanobsd/rescue/Files/root/
H A D.cshrc10 a lm 'll | less'
11 a m less
16 setenv PAGER less
/freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_min.h42 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
53 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
63 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_max.h43 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
54 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less>
66 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_is_sorted.h39 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less>
47 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dpstl_stable_sort.h35 class _Comp = less<>,
46 class _Comp = less<>,
H A Dranges_max_element.h40 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
49 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
H A Dranges_lower_bound.h45 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less>
54 …ndirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_minmax.h52 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
65 indirect_strict_weak_order<projected<const _Type*, _Proj>> _Comp = ranges::less>
76 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
H A Dranges_minmax_element.h48 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less>
57 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
/freebsd-14.2/contrib/llvm-project/libcxx/include/
H A Dalgorithm550 ranges::less>
560 ranges::less>
571 ranges::less>
755 weakly_incrementable O, class Comp = ranges::less,
773 weakly_incrementable O, class Comp = ranges::less,
781 weakly_incrementable O, class Comp = ranges::less,
922 weakly_incrementable O, class Comp = ranges::less,
945 ranges::less>
970 ranges::less>
1097 template<bidirectional_range R, class Comp = ranges::less,
[all …]
/freebsd-14.2/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-14.2/contrib/unifdef/tests/
H A Dif5.c51 #error FOOB is less than FOO
63 #error FOOB is less than or equal FOO
/freebsd-14.2/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

12345678910>>...29