Ghostscript is a processor for PostScript and PDF files. It can rasterize these files to a wide variety of printers, devices for screen preview, and image file formats. Since applications tend to prepare pages for printing in a high-level format such as PostScript, most Unix users with low-level bitmap printers, such as inkjets, use GhostScript as part of the printing process. In addition, Ghostscript is capable of converting PostScript files, functionality comparable to Adobe Acrobat Distiller, but on the command line. In addition, Ghostscript is used for file import and viewing by a great many other applications, including xv, ImageMagick, gimp, and xdvi. Several GUI wrappers for viewing PostScript and PDF files exist, including GSview, ghostview, gv, ggv, and kghostview. This is far from a comprehensive list.
ascii lists ASCII idiomatic names and octal/decimal code-point forms. It provides easy conversion between various byte representations and the American Standard Code for Information Interchange (ASCII) character table. It knows about a wide variety of hex, binary, octal, Teletype mnemonic, ISO/ECMA code point, slang names, XML entity names, and other representations. Given any one on the command line, it will try to display all others. Called with no arguments, it displays a small, handy ASCII chart.
NFSv4 specifies that the RPC calls be batched into a "compound" call. There is no support for this in RPCGEN. By rearranging the ONC IDL for NFSv4 into AutoGen definitions, these templates will emit the original IDL *plus* all the code to package, send, distribute, collect, return, and dispatch the results. The distributed program author merely needs to call and supply server procedures for the routines specified in the IDL. Templates for these calls and service routines is provided, too. The NFSv4 definitions are included.
This data structure features fast (O(log N)) insertion, removal, and retrieval of records, provided that there is a sorting relation over their keys and there are no entries with equal keys. The AVL tree is an explicit binary searching tree, where left children of each vertex are less or equal, while right children are greater or equal than the vertex itself. In addition, the tree is balanced so that the difference between the depths of the two subtrees of each vertex is at most one.
AVLMAP is a key:data pair data mapping (associative array) library for C programming based on AVL balanced binary trees. Added features include ordered data retrieval forward or reverse, support for optional duplicate keys (e.g. an extra linked list not needed), and the ability to find the nearest member if an exact match isn't available. Both key and data types may be selected from a choice of C data types including string and array variations. One mapping always has one key type, but data types may be mixed within a mapping.