Other listings by this author |
|
 Accumulate 1.3 (Downloads: 197)
Used to accumulate values by category. Used to accumulate values by category. It might be useful
for example in a billing program to accumulate hours by
various categories.
It could be used to count how many times various words
occurred in a document.
All you need is:
buckets.accumulate( "somecategory", someamount );
And Accumulate looks after creating the buckets to
accumulate new categories for you.
e....
|
|
 Replicator 11.3 (Downloads: 813)
The Replicator lets you distribute large numbers of files to many people. The Replicator lets you distribute large numbers of files to
many people efficiently. The software automatically
downloads just the changed files and deletes ones no longer
part of the distribution.
Unlike other similar tools, all it requires is an ordinary
HTTP website. It requires no code to run on the server.
It can also work with CDs, and LANs.
Custom configured for each customer. Not free. Registrat...
|
|
 TimeZones 1.9 (Downloads: 223)
Displays all the TimeZone on your machine supported by Java Displays all the TimeZoneon your machine supported by
Java, with their standard time and daylight saving time
offsets from GMT, along with the their ID (programmer) names
and display names. It also displays UTC time, local time, and
your default TimeZone and whether daylight savings is
currently in effect....
|
|
 CMOSSave 4.6 (Downloads: 346)
Check CMOS for corruption and automatically restore it. CMOSSave CMOSRest CMOSChk restore corrupted CMOS from
backup and check that CMOS has not been tampered with.
Naive users sometimes meddle with CMOS settings. We need a
fast way to put the scores of subtle CMOS configuration
settings back the way they were.
Power surges can corrupt CMOS. We need a way for a naive
user to quickly restore all the CMOS settings.
If the battery fails, the contents will be los...
|
|
 QuickSort 1.6 (Downloads: 303)
QuickSort is an implementation of Tony Hoare's classic recursive Quicksort. QuickSort is an implementation of Tony Hoare's classic
QuickSort. QuickSort works by choosing a pivot point and
ensuring all elements below the pivot point are small all
above are big, (i.e. smaller than the pivot) Then it
recursively splites the upper and lower halves, repeating
the process. QuickSort is an internal sort written in Java.
Both RadixSort and HeapSort are quicker than QuickSort.
QuickSort can also take patholo...
|
|
 ISBN 2.5 (Downloads: 348)
Tidies, interconverts and Validates ISBN-10 and ISBN-13 book numbers. Helps you proofread, interconvert, validate and tidy ISBN-10 and ISBN-13 (International Standard Book Number) references in your HTML or other documentation. It validates the checkdigit, inserts dashes, interconverts ISBN-10 and ISBN-13. It displays them both with and without dashes....
|
|
 File Splitter 1.3 (Downloads: 331)
Split large text/html files into smaller files using embedded split commands. Split large text/html files into smaller files. I find it
much faster and more accurate than cut and paste.
You embed commands in the big file telling it which pieces
of it are to go where, then let Splitter do the work. It is
much faster and more accurate than trying to select huge
blocks of text in an editor. You don't accidentally lose or
duplicate text. Keeping files small makes the site more
responsive.
|
|
 Primes 1.4 (Downloads: 485)
calculates the prime numbers 1..N, tells you if N is prime etc. calculates the prime numbers 1..N, tells you if N is prime etc.
Prints tables of primes.
Computes the prime just below or above N.
It is useful in computing optimal Hashtable sizes.
Java source included....
|
|
 LEDataStream 1.8 (Downloads: 252)
Little-endian replacements for DataInputStream, DataOutputStream and RandomAcces Little-endian replacements for DataInputStream, DataOutputStream and RandomAccessFile. They work just like DataInputStream, DataOutputStream and RandomAccessFile except they work with little-endian binary data. Normally Java binary I/O is done with big-endian data, with the most significant byte of an integer or float first. Intel and Windows 95 tend to work with little endian data in native files. LEDataInputStream, LEDataOutputstream and LERandomAccessFile will le...
|
|
 Volser 1.2 (Downloads: 383)
Gets the 4-byte 32-bit binary volume serial number in Windows. Gets the 4-byte 32-bit binary volume serial number of a Windows
disk drive assigned when it is formatted to provide and almost unique id.
Don't confuse this with the volser(, the string name,
or the manufacturer's disk serial number assigned to a hard drive at the factory.
Uses JNI and C++ native code.
Consists of java and JNI you include in your own code.
You can test with
C:
CD \com.mindprod...
|
|
 Splice 1.5 (Downloads: 456)
SPLICE splices bits of files together SPLICE splices bits of files together e.g.
SPLICE Cut MyFile.Txt Start 99 Length 99 Insert MyFile2.txt At 99
SPLICE Copy MyFile.Txt Start 99 Length 99 Overlay MyFile2.txt At 99
Uses for SPLICE:
1. excising a section of a file.
2. replacing a section of a file.
3. inserting a section into a file.
4. extracting a section of a file.
5. appending a section onto a file.
This program may be freel...
|
|
 Common11 2.8 (Downloads: 406)
common utility classes that work under Java 1.1+ common utility classes that work under Java 1.1 without using Arraylists or Swing.
Class library.
Requires Java version 1.1 or later.
BigDate: simplified date handling when you want dates without times.
CMPAboutBox: a proper about box that provides useful information.
ImageInfo: information about a GIF, png, jpg.
ImageViewer: component to display an image
Limiter: cap, corral and h...
|
|
 LinkedList 1.6 (Downloads: 198)
LinkedList is replacement for Java Vector class. Classical doubly linked list. LinkedList is replacement for Java Vector class. Classical
doubly linked list. Faster that Vector for insert/delete, but slower
for indexed access. The interface is modeled on java.util.Vector, so
you can try it both ways and pick which is faster for your needs.
Heavily commented Java source included. copyright (c) 1997-2008 Canadian Mind
Products. May be freely distributed and and used for any purpose
except military.
...
|
|
 VerCheck 4.4 (Downloads: 346)
VerCheck checks websites for new versions of the software you use. WHAT IT IS FOR
**************
I used to check over a dozen websites each day to see if new versions of the software I use had been released. This was time consuming and error prone. VerCheck automates this
process by checking the websites of the programs you use to see if the version numbers have changed. It comes preconfigured from the factory with 64 applications.
HOW IT WORKS
************
For each applica...
|
|
 Tabout 2.7 (Downloads: 233)
converts tabs to spaces in an ASCII text file. converts tabs to spaces in an ASCII text file
usage : TABOUT Myfile.TXT
Don't use it on word processor files. Assumes tab stops
are 8 columns apart. Also trims ^Z and corrects any
malformed CrLf line endings. C source included.
Copyrighted, but may be distributed freely and used for
any purpose except military....
|
|
 FileIO 6.1 (Downloads: 600)
Generates sample Java code to do 617 types of I/O. I/O teaching tool that generates sample Java source code to read or write the console, a sequential file, a random access file, a String, an array of characters, an array of bytes, URL, HTTP CGI GET/POST, Socket, resource or Pipe. It shows you how to read or write ASCII-8 bit characters (plain or locale-encoded), Unicode 16-bit characters, raw bytes, big endian binary, little endian binary, or serialised objects, buffered, unbuffered or gzip compressed.
|
|
 HeapSort 1.7 (Downloads: 263)
HeapSort is an implementation of Williams and Floyd classic HeapSort. HeapSort is an implementation of Williams and Floyd's TopDown HeapSort.
HeapSort is a fast internal sort written in Java that uses a
sorting algorithm analogous to power struggles for higher
positions in a hierarchical bureaucracy. Source provided. It
is faster than QuickSort, but slower that RadixSort. It
sorts using a comparison routine you provide to compare two
elements to be sorted.
You can test it with:
|
