Ports 搜索

Sphinx is a full-text search engine, distributed under GPL version 2. Commercial license is also available for embedded use. Generally, it's a standalone search engine, meant to provide fast, size-efficient and relevant fulltext search functions to other applications. Sphinx was specially designed to integrate well with SQL databases and scripting languages. Currently built-in data sources support fetching data either via direct connection to MySQL, or from an XML pipe. As for the name, Sphinx is an acronym which is officially decoded as SQL Phrase Index.

phpWebApp is an application framework which makes easy and simple the task of building PHP web applications based on relational databases. It separates the task of designing and changing the layout of the application from the task of implementing the logic of the application, by using XML templates that are an extension of XHTML. It also simplifies the task of implementing the logic of the application by offering an event based programming model. In addition, phpWebApp tries to offer modularity and code reusability to the community of webApp developers.

Redmine is a flexible project management web application written using Ruby on Rails framework, it is cross-platform and cross-database. Feature Overview: * Multiple projects support * Flexible role based access control * Flexible issue tracking system * Gantt chart and calendar * News, documents & files management * Feeds & email notifications * Per project wiki * Per project forums * Time tracking * Custom fields for issues, time-entries, projects and users * SCM integration (SVN, CVS, Git, Mercurial, Bazaar and Darcs) * Issue creation via email * Multiple LDAP authentication support * User self-registration support * Multilanguage support * Multiple databases support

Ur is a programming language in the tradition of ML and Haskell, but featuring a significantly richer type system. Ur is functional, pure, statically-typed, and strict. Ur supports a powerful kind of metaprogramming based on row types. Ur/Web is Ur plus a special standard library and associated rules for parsing and optimization. Ur/Web supports construction of dynamic web applications backed by SQL databases. The signature of the standard library is such that well-typed Ur/Web programs "don't go wrong" in a very broad sense. Not only do they not crash during particular page generations, but they also may not: * Suffer from any kinds of code-injection attacks * Return invalid HTML * Contain dead intra-application links * Have mismatches between HTML forms and the fields expected by their handlers * Include client-side code that makes incorrect assumptions about the "AJAX"-style services that the remote web server provides * Attempt invalid SQL queries * Use improper marshaling or unmarshaling in communication with SQL databases or between browsers and web servers

Checkmol is a command-line utility program which reads molecular structure files in different formats and analyzes the input molecule for the presence of various functional groups and structural elements. At present, approx. 200 different functional groups are recognized. This output can be easily placed into a database table, permitting the creation of chemical databases with a functional group search option. Checkmol also outputs a set of statistical values derived from a given molecule, which can also be used for quick retrieval from a database. These values include: the number of atoms, bonds, and rings, the number of differently hybridized carbon, oxgen, and nitrogen atoms, the number of C=O double bonds, the number of rings of different sizes, the number of rings containing nitrogen, oxygen, sulfur, the number of aromatic rings, the number of heterocyclic rings, etc. The combination of all of these values for a given molecule represents some kind of "fingerprint" which is useful for rapid pre-selection in a database structure/substructure search prior to a full atom-by-atom match. Matchmol complements the capabilities of checkmol. It compares two (or more) molecular structures and determines whether one of them is a substructure of the other one. This is done by a full atom-by-atom comparison of the input structures. Thus, matchmol can be used as a back-end program for structure/substructure search operations in chemical databases. The port installs both checkmol and matchmol.

A graphical front-end to `cscope' and its clone `cs' with a number of nice features, including: - Graphical window interface for general ease of use. - Function call hierarchy and function viewer. - Recall of previous queries and query results for easy browsing. - Ability to switch between databases and query back-ends. - Source code highlighting ala Emacs. - Querying and building may be performed simultaneously. - Build database dialog allows interactively configuring source and include directories. - Saves queries and/or query results for later sessions. - Query results and file browser separated by adjustable pane. - Full text search in viewer windows. - Convenient key and button bindings. - Ability to invoke any editor directly from browser. - Crude but existing help menu.

Combined scanner/parser generator for LR compliant grammar definitions. The generated C++ parser class is used as a super class from which a parser implementation class must be derived. The implementation class implements the scanner feed methods but also all required semantic action method. dragon has been used for several large projects with complex grammar definitions (about 200 productions/ 80 tokens ). Since for those grammar defintions, the analyse phase to build up the parse table is quite CPU intensive, it is recommended to use state of the art hardware. dragon requires the base package to get compiled but also for the compilation of the generated C++ code. It can be used for databases/cego and probably other applications. Many more details are available at:

convertible provides a typeclass with a single function that is designed to help convert between different types: numeric values, dates and times, and the like. The conversions perform bounds checking and return a pure Either value. This means that you need not remember which specific function performs the conversion you desire. Also included in the package are optional instances that provide conversion for various numeric and time types, as well as utilities for writing your own instances. Finally, there is a function that will raise an exception on bounds-checking violation, or return a bare value otherwise, implemented in terms of the safer function described above. Convertible is also used by HDBC 2.0 for handling marshalling of data to and from databases. Convertible is backed by an extensive test suite and passes tests on GHC and Hugs.

mtbl is a C library implementation of the Sorted String Table (SSTable) data structure, based on the SSTable implementation in the open source Google LevelDB library <https://github.com/google/leveldb>. An SSTable is a file containing an immutable mapping of keys to values. Keys are stored in sorted order, with an index at the end of the file allowing keys to be located quickly. mtbl is not a database library. It does not provide an updateable key-value data store, but rather exposes primitives for creating, searching and merging SSTable files. Unlike databases which use the SSTable data structure internally as part of their data store, management of SSTable files -- creation, merging, deletion, combining of search results from multiple SSTables -- is left to the discretion of the mtbl library user.

Data::ObjectDriver is an object relational mapper, meaning that it maps object-oriented design concepts onto a relational database. It's inspired by, and descended from, the MT::ObjectDriver classes in Six Apart's Movable Type and TypePad weblogging products. But it adds in caching and partitioning layers, allowing you to spread data across multiple physical databases, without your application code needing to know where the data is stored. It's currently considered ALPHA code. The API is largely fixed, but may seen some small changes in the future. For what it's worth, the likeliest area for changes are in the syntax for the search method, and would most likely not break much in the way of backwards compatibility.