uuencode Command not found but man working fine
Solution 1
I think it's most likely that you just have the man-page for a command that's not installed at your system. uuencode
used to be part of the "standard selection" of commands, but many of these are no-longer installed by default (eg. like compact
, vi
and ed
) - mostly because new and better commands have taken their place. There are however "standard selections" of man-pages too (which is installed when you install man), so it's very likely that such a selection contains man-pages for commands not installed by default on a system.
See if you can find a package called "sharutils" or something like that, and install it.
Solution 2
Like Baard Kopperud said, this mean that man page installed by program itself does not.
All software in Red Hat is installed via packages. It's usual to package big set of basic system man pages belongs to one package, but program itself may belong to other.
In modern Red Hat you need to use yum provides '*/uudecode'
to find which package you need to install for uudecode. In my RHEL5 package name is sharutils. As you figured out missing package name, use yum install <package>
. Installation should be done with root privileges.
Related videos on Youtube
Ragen Dazs
Updated on September 18, 2022Comments
-
Ragen Dazs over 1 year
I need to port Sort procedure from TList to receive an PHP Array
procedure TList.Sort(Compare: TListSortCompare); begin if (FList <> nil) and (Count > 0) then QuickSort(FList, 0, Count - 1, Compare); end;
and navigating by QuickSort whe have this code:
procedure QuickSort(SortList: PPointerList; L, R: Integer; SCompare: TListSortCompare); var I, J: Integer; P, T: Pointer; begin repeat I := L; J := R; P := SortList^[(L + R) shr 1]; repeat while SCompare(SortList^[I], P) < 0 do Inc(I); while SCompare(SortList^[J], P) > 0 do Dec(J); if I <= J then begin T := SortList^[I]; SortList^[I] := SortList^[J]; SortList^[J] := T; Inc(I); Dec(J); end; until I > J; if L < J then QuickSort(SortList, L, J, SCompare); L := I; until I >= R; end;
I'm not understanding what this prototype means:
procedure QuickSort(SortList: PPointerList; L, R: Integer; SCompare: TListSortCompare);
PPointerList => OK, L, R => OK
SCompare: TListSortCompare ??? What is this???
TListSortCompare = function (Item1, Item2: Pointer): Integer;
I can't understand this code flow.
As you can see http://php.net/sort uses an implementation of » Quicksort - but not the same code flow.
-
David Heffernan over 11 yearsYou don't need to port that code. Use PHP's built in
sort
-
Ragen Dazs over 11 yearsBut not the same implementation of SCompare: TListSortCompare
-
David Heffernan over 11 yearsOK, but it wasn't obvious to me that you needed a custom comparer. No matter, you really don't want to be porting something as fundamental as this and
usort
is definitely the right answer if you need custom comparer. -
Ragen Dazs over 11 yearsSure. In the first time I not understood Delphi QuickSort code, but now it's all clear. Thanks for your help.
-
iTag almost 10 yearsWhat operating system (and if Linux, what distro) are you running?
-
Sejwal almost 10 yearsRedHat 4.1.2-44
-
-
prashant thakre over 9 yearsYes its working fine,