Description

Self-balancing binary trees in the AVL sense (the depth of any left branch differs by no more than one from the depth of the right branch).

Informations

• Status: Fully functional
• Source: Included
• Size: 51 703kB

Platforms: D2005, D2006, D2007, D2009, D2010, D7, DXE, DXE2, DXE3, DXE4, DXE64

Description

AlphaTIXx92s technology provides user with highest indexing performance and a possibility to index large volume of data quickly. Fuzzy search is its general feature that makes the program very different from another developer's you have a possibility to provide your application with search engine allowing retrieving a text with mistakes, "mismatches", etc. It does not require the stemming. It allows to create search engines with multilaguage-text support. Unicode and ANSI support provides with flexibility enough to find not only regular English words, but other languages too...

AlphaTIX provides your projects with powerful query operators for help to find the information in supporting the Boolean operators (and, or, not) searches. AlphaTIX's flexibility and possibility to set search results similarity degree let your user to search on a large variety of words and phrases. AlphaTIX can work as well with small systems as it does with large ones. It has no index volume restrictions that can be more than 2 Gb. To protect your work you can save the index even after computer fault. It works automatically. AlphaTIX can be used as dll or as COM-server.

So generally AlphaTIX main features include:

• support approximate (fuzzy), prefix and exact search;
• boolean query (and, or, not);
• language neutral, support for indexing multilanguage documents;
• full Unicode and ANSI support;
• partial support for vector space model that allows to arrange the documents more precisely by similarity to the query;
• stop words support;
• fault tolerant database with transaction support;
• provides with index saving even after computer faults. The save time can be set.

You can use it as library or application with OLE interface using OLE-automation. SDKs available for Visual Basic, Visual C, C++ Builder, Delphi.

Informations

• Status: With Nag-Screen
• Source: On purchase/registration
• price: $268.65
• Source price: $4999
• Exe demo: included
• Size: 710kB

Platforms: CB3, CB4, CB5, CB6, D2, D3, D4, D5, D6, D7

Description

AVL tree - balanced binary search tree (see Dr. D.E.Knuth "Art of Computer Programming" for more information). Very fast item insertion, replacing, deletion.

Informations

• Status: Fully functional
• Source: Included
• Size: 6kB

Platforms: D4, D5

Description

High efficient dynamic hash table with tree organization.

The existing implementations of hash-tables have the important disadvantage - fixed size. As a corollary, if the table is filled more than 90% search and insert operation become very slow. HashTrie represents new efficient data structure. It combines in herself properties of the hash-tables and trie (digital-trees). As against the usual hash-tables the size HashTrie is not fixed, that allows to work with a unknown beforehand amount of datas.

Informations

• Status: Fully functional
• Source: Included
• Size: 101kB

Platforms: CB3, CB4, CB5, CB6, D2, D3, D4, D5, D6, D7

Description

A buffered sorter for an unlimmited amount of records with a fixed length using a three-way merge for memory and a buffered multi-way merge for files. The multi-way merge is the same as in TMSor. Ten Million records of 100 bytes are sorted in about 9 minutes (PII 400 and Windows 98).

Informations

• Status: Fully functional
• Source: Included
• Size: 13kB

Platforms: CB1, CB3, D2, D3, D4

Description

A very fast String search engine, about twice as fast as Boyer-Moore, based on an article in the German magazine (8/97).

Informations

• Status: Fully functional
• Source: Included
• Size: 22kB

Platforms: CB1, CB3, D2, D3, D4

Description

MWDelPar is a lightning fast syntax anylyser for Delphi source code (2.5 - 5 MB/S on PII 400), roughly 100000 lines/second. Could be a base for:

• ClassBrowsers
• ClassDesigners
• UML tools
• Interpreters
• Scripting
• etc.

Informations

• Status: Fully functional
• Source: Included
• Size: 51kB

Platforms: D4

Description

NitroSort is a fast, full-featured sort utility. It's also royalty free, unlike our competitors.

Features:

• Interfaces will all Window's languages including VB, Microsoft VC++, Delphi, etc.
• Runtime DLL easily distributed with your product
• Record filtering capability based on boolean expressions
• File types including text, variable and fixed length
• Multiple input files sorted simultaneously
• Support for PC and mainframe data types
• Support for reformatting output while sorting
• Memory and disk-based sorting
• Unlimited number of sort keys.

You can find out more about the full capabilities on the home page.

Informations

• Status: Evaluation (time-limit)
• Source: N/A
• price: $89
• Size: 1 533kB

Platforms: CB1, CB3, CB4, CB5, CB6, D1, D2, D3, D4, D5, D6

Description

The Regular Expression Library, a library of components and classes to do searching and replacing of data using Regular Expressions. There is full support for using the library in non-VCL modules as well as VCL components.

The library uses the VCL property-method-event model in both the VCL and non-VCL versions. The library is very powerful, flexible, fast, and easy to use, Regular Expressions are a means of doing searching based on patterns adopted from the UNIX idea of Regular Expressions.

The library supports localization of regular expressions, error messages, and searching locales.

Informations

• Status: Fully functional
• Source: None
• Size: 3 380kB

Platforms: CB3, CB4, CB5, CB6

Description

Simple Boolean Search is Delphi unit providing boolean search by using operators AND and OR. Multiple brackets are possible.

Informations

• Status: Fully functional
• Source: Included
• Size: 4kB

Platforms: D1, D2, D3, D4, D5, D6, D7

Description

Variant Dictionary for Delphi 7.

Informations

• Status: Fully functional
• Source: Included
• Size: 9kB

Platforms: D7

Description

TmSor is a study how to create a powerful sorter with a minimum of work. Fixed records only.

Informations

• Status: Fully functional
• Source: Included
• Size: 11kB

Platforms: CB1, CB3, D2, D3, D4

Description

TQSort is a component which wraps quick sorting algorithm. Usage of this component is very simple, and just need to provide two functions - for comparing two elements and for swapping to elements. These functions gives the ability to sort any type of data. Implementation of algorithm avoids known problem with big stack usage.

Informations

• Status: Fully functional
• Source: Included
• Size: 11kB

Platforms: D1, D2