Other listings by this author |
Converter 5.5 (Downloads: 376)
How to Interconvert any of the Java primitives. Conversion Amanuensis. Conversion teaching tool. Shows you how to convert any of the 17 basic Java types into any of the other. Conversion Amanuensis as your side whenever you need Java code to convert anything to anything else. Runs an as Applet or application.
To install, Extract the zip download with WinZip, available from
winzip.com (or similar unzip utility) into any
directory you please, often C:\ -- ticking off the (user
folder names) option. To run ...
|
CanadianTax 4.2 (Downloads: 580)
Calculates Canadian sales taxes: GST HST and PST today or in the past. Calculates Canadian sales taxes: GST HST and PST today or as they were in the past.
Java Applet that can also be run as an application.
Requires Java version 1.5 or later.
Java source code and sample HTML included.
This version computes by adding GST HST and PST to a base
price. It als works in reverse given the
final price working backwards to get the taxes and base
price. In other words it will tell ...
|
SortedArrayList 1.3 (Downloads: 199)
Sort and Merge ArrayLists efficiently. This is a pair of library classes to include in your own
code for manipulating ArrayLists.
It consist of two classes: SortedArrayList and Merge.
SortedArrayList is an ArrayList that remembers how it is
sorted, so that if you ask it to sort, it can sometimes
bypass the work when it is already in order. You declare the
order you want and it keeps the list sorted, You just call
sort whenever you need the list to ...
|
HeapSort 1.7 (Downloads: 206)
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:
|
FileIO 6.1 (Downloads: 532)
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.
|
LEDataStream 1.8 (Downloads: 221)
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...
|
Tabin 5.3 (Downloads: 229)
Converts spaces to tabs in an ASCII text file. Converts spaces to tabs in an ASCII text file
Usage:
TABIN.exe Myfile.txt
Assumes tab stops are 8 columns apart. Don't use it on word
processor files. C source included. Copyrighted by Canadian
Mind Products. May be freely distributed and used for any
purpose except military. It has been rewritten in C from
Pascal for extra speed. Users of previous versions should
take care to delete the old TABIN.COM...
|
FourTidy 3.1 (Downloads: 279)
Tidies Take Command/TCC/4NT/4DOS DESCRIBE file descriptors To tidy, sort, prune and dedup a JP Software
Take Command/TCC/4NT/4DOS hidden descript.ion file. These files are used by
the DESCRIBE utility to track what your various files
are for.
First make the directory containing the usually-hidden descript.ion file
current. e.g.
C:
cd \env
Then invoke the java program with:
java.exe -jar C:\com\mindprod\fourtidy\fourtidy.jar
If you...
|
ShellSort 1.4 (Downloads: 209)
ShellSort is a simple sort suitable for 2000 or less elements. ShellSort is a simple sort suitable for 2000 or less
elements. It sorts using a comparision routine you provide
to compare two elements to be sorted.
You can test it with:
java.exe com.mindprod.shellsort.TestShellSort...
|
Pws 2.0 (Downloads: 205)
PWS (the pathway amanuensis) helps you with personal problems. PWS (the pathway amanuensis) helps you with personal
problems. You describe your problem and it prescribes some
sage advise based on Ken Keyes' twelve pathways from the
book Handbook To Higher Consciousness.
To install, Extract the zip download with WinZip, available from
winzip.com (or similar unzip utility) into any
directory you please, often C:\ -- ticking off the (user
folder names) option. To run as an applicat...
|
Holiday Calculatior 4.7 (Downloads: 678)
Calculate when 66 holidays occur in any given year. Calculates when various holidays occur in any given year BC or AD.
Designed to be cannibalised to include the calculation routines in your
own programs. You might use it to prepare paper calenders well in
advance or electronic calendars. You might also use the logic in computer
programs that compute payrolls, bus schedules, or club meetings. You
might use it in writing novels or researching historical events. It can
als...
|
LinkedList 1.6 (Downloads: 176)
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.
...
|
Http 2.9 (Downloads: 690)
HTTP GET/POST/HEAD/PROBE/CHASE java class library for http: or https: http is a small library of Java classes to let you do GET/POST/HEAD/PROBE/CHASE to a server r with http: or https. It will also encode parameter pairs for you.
It does nothing on its own. It is intended to be incorporated into your own programs.
To see a sample use have a look at the com.mindprod.submitter package, downloadable...
|
Boyer 1.5 (Downloads: 233)
Fast string search (indexOf) using the Boyer-Moore algorithm. Fast string search (indexOf) using the Boyer-Moore
algorithm. Incorporate this class into your own Java
programs to rapidly search strings.
use:
import com.mindprod.Boyer.Boyer;
...
Boyer b = new Boyer("dogcatwombat");
int where = b.indexOf("cat");
or
int where = Boyer.indexOf("dogcatwombat","cat");
Boyer-Moore is about twice as fast as String.indexOf wh...
|
CurrCon 4.5 (Downloads: 549)
CurrCon displays prices in HTML in users' home currency. Currency Conversion Applet.
CurrCon is an Applet you embed in your HTML
to display prices in a variety of world currencies
defaulting to the user's country.
It usually works in conjunction with the htmlmacros
pre-processor to insert the necessary Applet calls,
though you can do it manually.
Shareware for non military use only.
Registrants get help setting it up....
|
FontSaver 1.4 (Downloads: 203)
FontSaver shares Font objects instead of creating new ones. FontSaver shares Font objects instead of creating new ones to cut
down on the RAM and time needed to create Font and Font peer objects.
Profiling often shows the creation of too many Font objects is the
cause of poor performance.
See the source code for how to incoporate it into your own programs.
It does nothing on its own....
|
QuickSort 1.6 (Downloads: 222)
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...
|