Blitz++ library moves high-level optimizations out of compilers and into libraries in C++. It was created due to the fact that until recently, C++ lagged behind Fortran's performance by anywhere from 20% to a factor of ten. The C++ programming language offers many features useful for tackling complex scientific computing problems, but unfortunately, these advanced features came with this hefty performance pricetag. This program presents a possible solution.
Boost was begun by members of the C++ standards committee Library Working Group to provide free peer-reviewed portable libraries to the C++ community. An additional objective is to establish "existing practice" and provide reference implementations so that the Boost libraries are suitable for eventual standardization. Indeed, the explicit intent is to propose many of these libraries for inclusion in the C++ Standard Library. The Boost Graph Library, formerly known as the Generic Graph Component Library (GGCL), is a collection of graph algorithms and data structures created in the generic programming style of the Standard Template Library (STL).
pgAdmin III is an administration and management tool for the PostgreSQL database and derivative products such as EnterpriseDB, Mammoth PostgreSQL, Pervasive Postgres, and SRA PowerGres. It includes a graphical administration interface, an SQL query tool with grahical EXPLAIN, a procedural code editor, an SQL/shell/batch scheduling agent, Slony-I management, and much more. It is designed to answer the needs of most users, from writing simple SQL queries to developing complex databases. The graphical interface supports all PostgreSQL features and makes administration easy.
GSview is a graphical interface for Ghostscript, an interpreter for the PostScript page description language used by laser printers. For documents following the Adobe PostScript Document Structuring Conventions, it allows selected pages to be viewed or printed. GSview requires Ghostscript 7 or later.
libkdtree++ is a C++ template container implementation of k-dimensional space sorting, using a kd-tree. It sports a theoretically unlimited number of dimensions, and can store any data structure. Provided the data structure, it provides operator[0 - k-1] to access the individual dimensional components (arrays, std::vector already do) and a std::less implementation for the type of dimensional components. It has support for custom allocators, implements iterators, and provides standard find as well as range queries. It has amortised O(lg n) time (O(n lg n) worst case) on most operations (insert/erase/find optimised) and worst-case O(n) space, and also provides a means to rebalance and thus optimise the tree.