Ports 搜索

Distel extends Emacs Lisp with Erlang-style processes and message passing, and the Erlang distribution protocol. With this you can write Emacs Lisp processes and have them communicate with normal Erlang processes in real nodes. Includes some useful applications (Dynamic TAGS, debugger, process list, profiler and more).

trivial-features ensures consistent *FEATURES* across multiple Common Lisp implementations. For example, on MacOS X platforms, while most Lisps push :DARWIN to *FEATURES*, CLISP and Allegro push :MACOS and :MACOSX instead, respectively. Some Lisps might not push any feature suggesting MacOS X at all. trivial-features will make sure all Lisps will have :DARWIN in the *FEATURES* list when running on MacOS X.

trivial-gray-streams is a trivial library which provides an extremely thin compatibility layer for Gray streams. From David N. Gray's STREAM-DEFINITION-BY-USER proposal: "Common Lisp does not provide a standard way for users to define their own streams for use by the standard I/O functions. This impedes the development of window systems for Common Lisp because, while there are standard Common Lisp I/O functions and there are beginning to be standard window systems, there is no portable way to connect them together to make a portable Common Lisp window system. There are also many applications where users might want to define their own filter streams for doing things like printer device control, report formatting, character code translation, or encryption/decryption."

Dynamic programming is a simple yet powerful technique for solving optimisation problems. When the problem at hand can be split in smaller problems, such that the smaller solutions of an optimal solution are themselves optimal, dynamic programming can be used to avoid re-calculating solutions to shared sub- problems. Simple problems are both easily specified and easily implemented, but for complex problems translating the specification of the problem into the implementation of the dynamic programming algorithm becomes tedious and error prone. The goal of DPROG is to alleviate this by automatically translating the specification of the problem into an implementation of the solution. The DPROG language is designed to be close to the ``mathematical'' notation used for expressing recurrences, thus making it easier to specify the problem. Using the DPROG compiler, the manual implementation step can be completely avoided.

The dwarfdump tool prints the various elements of DWARF debugging information found in ELF object files.

Create a customized, optimized, non-lobotomized, uncompromised, and thoroughly specialized parameter checking subroutine.

Easy GIT is a single-file wrapper script for git, designed to make git easy to learn and use.

While Eiffel is widely regarded as the best language for creating fast, robust, scalable applications, EiffelStudioTM is the only tool for realizing the full power of the Eiffel Development FrameworkTM. It is available under a Dual Licensing model. Users can use either commercial or Open Source licensing. EiffelStudio is more than just an IDE. Imagine being able to model your system as you think - capturing your requirements and your thought processes in Eiffel. Then, when you are ready to Design, you build upon the model you just created, still in Eiffel. And then you implement, in Eiffel. You never need to throw anything out and start over. You don't need extra tools to be able to go back and make changes in architecture safely. Roundtrip engineering? It's built in by design. Testing, metrics and productivity tools? They're built in. And debugging? Eiffel's native Design by ContractTM prevents 90% of the bugs from ever occurring in the first place - and what bugs remain are easily traced and repaired, typically within ten minutes.

elfrc is a utility that is able to compile resources (files) to object files. It can also generate corresponding C/C++ header files to use these resources from within a linked application.

This extended sorting algorithm allows you to a) sort an array by ANY field number, not only the first b) find duplicates in your data-set and sort them out.