This is a fast prime number list generator using sieve algorithm. This function return a list of prime numbers which <= argument.
primepow(aNumber) finds the prime number P and power N of aNumber such that aNumber = P^N.
The implementation is heavily borrowed from Art Owen <a href="http://www.csit.fsu.edu/~burkardt/cpp_src/oa/oa.html">Orthogonal...
Based on the ideas from the Olson Database, this will provide native Delphi code that converts perfectly between UTC and local time, even for historic timestamps, and as far as possible, also for future timestamps.
DUnit automates unit testing of Delphi code. The target audience for DUnit is developers who are both writing the code to be tested and the unit tests for that code, an approach advocated by Extreme Programming. Dunit is is a Delphi port of JUnit.
Digital Persona One Touch Delphi Code is designed to help developers deploy Digital Persona fingerprint scanners in a Delphi application. The code consists of a set of standard procedures and will use the SDK for Delphi, while also offering...
Lightweight prime number generation library. Makes use of OpenMP and aims for performance. Suitable for applications in cryptography or just for educational demonstration.
This helper allows you to write NSIS scripts in Delphi code using Ctrl-Space style and compile them into Software Distribution using NSIS installation system.
WhiteStarUML is a fork of StarUML with an intent to revive its Delphi code base by updating code to recent Delphi editions, reducing dependence on third party components and fixing bugs and adding new features.
This is an evolutionary algorithm that returns a random list of prime numbers. This code is highly inefficient for a reason. This algorithm is more of a proof of concept that if a prime was a heritable trait, it would not be a desired one.
The algorithm is based on the idea
that the next larger prime after one prime is the sum of the two smaller previous minus three prime numbers back.
For the first five prime numbers 2,3,5,7,11 this pattern is not true also it is not...
Team Remote Debugger allows you and your team to trace any number of code units of any kind ( ASP, MTS, T-SQL, COM+, ActiveX Exe, DLL, COM, Thread, CFML, ISAPI ), written in any language ( ASP, VB, VC++, Delphi, T-SQL, VJ ) residing on multiple...
This program implements primality testing function.
The function is then used to generate prime numbers
in the given range.
Since the excellent <a href="http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/366178">fast prime number list generator</a> recipe, it's simple to implement a function to check if its input it's a prime number.
Automate your code! Don want to write 250 lines of code, that only have one number different? Code Automator will help you!
DNS resolver component for use with Delphi 5-7.Features: * Recursive resolver. * Resolve records for A, MX, NS, CNAME and more. * VCL component* Native Delphi code, no external DLL or OCX required.
Two part tools for separating your SQL from code. Component which simplifies your Delphi code on running SQL for you.
This 32bit utility will parse your Delphi source files and build a help project (RTF, HPJ, and CNT files). It will use comments in the source file as the different help topics. Will observe conditional compiler directives in the Delphi code. Help...
Package to deal with the HTML code. Currenty contains HTML parser that allows to parse HTML code and various HTML tags. Native Delphi code.
SmoothCoder is a Delphi-To-HTML formatter. It takes in delphi code and spits out an HTML page, with the text formatted to look like code in the Delphi Editor. (E.g. reserved words are in bold, comments blue and italic, strings blue etc.).The...
Using python 2.6 & numpy.
This code was first posted here