| /netbsd-src/external/bsd/less/dist/ |
| H A D | Makefile.aut | 3 EMAIL = bug-less@gnu.org 4 HOMEPAGE = https://greenwoodsoftware.com/less 37 charset.h cmd.h funcs.h lglob.h less.h lesskey.h option.h \ 40 less.nro less.man lesskey.nro lesskey.man lessecho.nro lessecho.man \ 41 less.hlp \ 60 help.c: less.hlp 63 ${srcdir}/${MKHELP} < less.hlp > help.c 79 less.nro less.man lesskey.nro lesskey.man lessecho.nro lessecho.man 92 ${srcdir}/less.nro: ${srcdir}/less.nro.VER ${srcdir}/version.c 93 ${REPLACE_VERSION} ${srcdir}/less.nro.VER [all …]
|
| H A D | README | 2 This is the source code distribution of "less". 14 Please report any problems at https://github.com/gwsw/less/issues. 15 See https://greenwoodsoftware.com/less for the latest info. 16 Source repository is at https://github.com/gwsw/less.git. 21 ONLY IF you are doing development on the less source itself. 22 If you are merely using less as a tool, you should download a release 25 The formatted manual page is in less.man. 26 The manual page nroff source is in less.nro. 38 zip file with a name like less-999.tar.gz or less-999.zip downloaded 53 Specifies the regular expression library used by less for pattern [all …]
|
| H A D | NEWS | 2 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 633 and 643 16 * Fix problem when a program piping into less reads from the tty, 45 Major changes between "less" versions 632 and 633 52 Major changes between "less" versions 608 and 632 123 Major changes between "less" versions 590 and 608 190 Major changes between "less" versions 581 and 590 [all …]
|
| H A D | Makefile.dsu | 38 all: less lesskey 42 less: $(OBJ) 53 $(OBJ): less.h defines.h 57 -del less.exe
|
| H A D | Makefile.dsb | 29 all: less$(EXT) lesskey$(EXT) 33 less$(EXT): $(OBJ) 45 $(OBJ): less.h defines.h 49 -del less.exe
|
| H A D | Makefile.wnm | 34 all: less.exe lesskey.exe 36 less.exe: $(OBJ) 46 $(OBJ): less.h defines.h funcs.h cmd.h 50 -del less.exe
|
| H A D | Makefile.wnb | 36 all: less lesskey lessecho 42 less: ${OBJ} 55 ${OBJ}: less.h defines.h funcs.h cmd.h 64 -del less.exe
|
| /netbsd-src/external/bsd/less/dist/lesstest/ |
| H A D | runtest | 13 my $less; 29 $less = (rfile($opt{l}, $cwd) or "$srcdir/../obj/less"); 36 die "cannot execute $less: $!" if not -x $less; 37 die "$less is not compiled to support LESSTEST" if not less_is_test($less); 70 my $cmd = "$lesstest $lt_opts -s '$lt_screen' -t '$file' '$less'"; 104 my ($less) = @_; 105 my $ver = `$less -V`;
|
| H A D | maketest | 18 my $less = ($opt{l} or "../obj/less"); 26 if (not less_is_test($less)) { 27 print "$less is not compiled to support LESSTEST\n"; 28 my ($dir) = $less =~ m|^(.*)/[^/]*$|; 49 …es COLUMNS=$columns $lesstest $lt_opts $ls_opts -s '$lt_screen' -o '$ltfile' -- $less '$textfile'"; 68 my ($less) = @_; 69 my $ver = `$less -V`;
|
| H A D | pipeline.c | 28 static void become_child_less(char* less, int argc, char* const* argv, char* const* envp, const cha… in become_child_less() argument 36 less_argv[less_argc++] = less; in become_child_less() 45 execve(less, less_argv, envp); in become_child_less() 46 fprintf(stderr, "cannot exec %s: %s\n", less, strerror(errno)); in become_child_less() 127 char* less = argv[0]; in create_less_pipeline() local 128 if (verbose) fprintf(stderr, "testing %s on %s\n", less, textfile); in create_less_pipeline() 135 …become_child_less(less, argc, argv, envp, pipeline->tempfile, pipeline->less_in_pipe, pipeline->sc… in create_less_pipeline()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/algorithm/ |
| H A D | sorting.d | 114 void completeSort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable, 115 …RandomAccessRange1, RandomAccessRange2)(SortedRange!(RandomAccessRange1, less) lhs, RandomAccessRa… 126 auto ub = assumeSorted!less(sortedSoFar).upperBound(rhs[i]); 164 bool isSorted(alias less = "a < b", Range)(Range r) 174 if (!binaryFun!less(r[i + 1], r[i])) continue; 176 !binaryFun!less(r[i], r[i + 1]), 190 if (!binaryFun!less(ahead.front, r.front)) continue; 193 !binaryFun!less(r.front, ahead.front), 254 bool isStrictlyMonotonic(alias less = "a < b", Range)(Range r) 258 return findAdjacent!((a,b) => !binaryFun!less(a,b))(r).empty; [all …]
|
| H A D | setops.d | 594 (alias less = "a < b", RangeOfRanges, Range) 601 return largestPartialIntersectionWeighted!less(ror, tgt, UnitWeights(), 673 (alias less = "a < b", RangeOfRanges, Range, WeightsAA) 685 topNCopy!heapComp(group(multiwayMerge!less(ror)), tgt, sorted); 834 struct MultiwayMerge(alias less, RangeOfRanges) in MultiwayMerge() argument 839 private alias comp = binaryFun!less; in MultiwayMerge() 891 MultiwayMerge!(less, RangeOfRanges) multiwayMerge 892 (alias less = "a < b", RangeOfRanges) 949 auto multiwayUnion(alias less = "a < b", RangeOfRanges)(RangeOfRanges ror) 1005 struct SetDifference(alias less = "a < b", R1, R2) [all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/algorithm/ |
| H A D | sorting.d | 117 void completeSort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable, 118 Lhs , Rhs)(SortedRange!(Lhs, less) lhs, Rhs rhs) 130 auto ub = assumeSorted!less(sortedSoFar).upperBound(rhs[i]); 168 bool isSorted(alias less = "a < b", Range)(Range r) 178 if (!binaryFun!less(r[i + 1], r[i])) continue; 180 !binaryFun!less(r[i], r[i + 1]), 194 if (!binaryFun!less(ahead.front, r.front)) continue; 197 !binaryFun!less(r.front, ahead.front), 258 bool isStrictlyMonotonic(alias less = "a < b", Range)(Range r) 262 return findAdjacent!((a,b) => !binaryFun!less(a,b))(r).empty; [all …]
|
| H A D | setops.d | 628 (alias less = "a < b", RangeOfRanges, Range) 635 return largestPartialIntersectionWeighted!less(ror, tgt, UnitWeights(), 707 (alias less = "a < b", RangeOfRanges, Range, WeightsAA) 719 topNCopy!heapComp(group(multiwayMerge!less(ror)), tgt, sorted); 871 struct MultiwayMerge(alias less, RangeOfRanges) 876 private alias comp = binaryFun!less; 929 MultiwayMerge!(less, RangeOfRanges) multiwayMerge 930 (alias less = "a < b", RangeOfRanges) 988 auto multiwayUnion(alias less = "a < b", RangeOfRanges)(RangeOfRanges ror) 992 return ror.multiwayMerge!(less).uniq!(not!less); [all …]
|
| /netbsd-src/external/bsd/less/bin/less/ |
| H A D | Makefile | 5 PROG= less 17 MLINKS= less.1 more.1 less.1 page.1 18 LINKS= ${BINDIR}/less ${BINDIR}/more ${BINDIR}/less ${BINDIR}/page
|
| /netbsd-src/external/apache2/llvm/dist/libcxx/include/experimental/ |
| H A D | set | 21 template <class Key, class T, class Compare = less<Key>> 25 template <class Key, class T, class Compare = less<Key>> 46 template <class _Value, class _Compare = less<_Value>> 50 template <class _Value, class _Compare = less<_Value>>
|
| H A D | map | 21 template <class Key, class T, class Compare = less<Key>> 25 template <class Key, class T, class Compare = less<Key>> 46 template <class _Key, class _Value, class _Compare = less<_Key>> 50 template <class _Key, class _Value, class _Compare = less<_Key>>
|
| /netbsd-src/distrib/vax/miniroot/ |
| H A D | list | 11 PROG usr/bin/less usr/bin/more 21 SPECIAL less srcdir external/bsd/less/bin/less
|
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/container/ |
| H A D | rbtree.d | 738 final class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false) 739 if (is(typeof(binaryFun!less(T.init, T.init)))) 746 alias _less = binaryFun!less; 750 static if (is(typeof(less) == string)) in version() 752 private enum doUnittest = isIntegral!T && (less == "a < b" || less == "a > b"); in version() 821 static if (less == "a < b") 1182 static if (less == "a < b") 1196 static if (less == "a < b") 1271 static if (less == "a < b") 1318 static if (less == "a < b") [all …]
|
| /netbsd-src/distrib/evbsh3/rom/ramdiskcommon/ |
| H A D | ramdiskbin.conf | 40 progs indent ipcrm ipcs join jot kdump ktrace lam last lastcomm leave less 52 special less srcdir external/bsd/less/bin/less 56 ln less more
|
| /netbsd-src/external/apache2/llvm/dist/libcxx/include/ |
| H A D | compare | 47 static const partial_ordering less; 71 static const weak_ordering less; 97 static const strong_ordering less; 186 static const partial_ordering less; 235 return __v < 0 ? partial_ordering::greater : (__v > 0 ? partial_ordering::less : __v); 241 _LIBCPP_INLINE_VAR constexpr partial_ordering partial_ordering::less(_OrdResult::__less); 255 static const weak_ordering less; 262 : (__value_ < 0 ? partial_ordering::less : partial_ordering::greater); 309 return __v < 0 ? weak_ordering::greater : (__v > 0 ? weak_ordering::less : __v); 316 _LIBCPP_INLINE_VAR constexpr weak_ordering weak_ordering::less(_OrdResult::__less); [all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
| H A D | ranges_algo.h | 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 …]
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
| H A D | ranges_algo.h | 1632 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1645 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1660 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1673 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1688 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1701 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1716 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1729 typename _Comp = ranges::less, typename _Proj = identity> in _GLIBCXX_VISIBILITY() 1746 _Comp = ranges::less> in _GLIBCXX_VISIBILITY() 1767 _Comp = ranges::less> in _GLIBCXX_VISIBILITY() [all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/container/ |
| H A D | rbtree.d | 745 final class RedBlackTree(T, alias less = "a < b", bool allowDuplicates = false) 746 if (is(typeof(binaryFun!less(T.init, T.init)))) 753 alias _less = binaryFun!less; 757 static if (is(typeof(less) == string)) 759 … private enum doUnittest = is(byte : T) && isIntegral!T && (less == "a < b" || less == "a > b"); 829 static if (less == "a < b") 1322 static if (less == "a < b") 1336 static if (less == "a < b") 1411 static if (less == "a < b") 1458 static if (less == "a < b") [all …]
|
| /netbsd-src/distrib/sparc/miniroot/ |
| H A D | list | 16 PROG usr/bin/less usr/bin/more 21 SPECIAL less srcdir external/bsd/less/bin/less
|