Other listings by this author |
|
FileIO 6.1 (Downloads: 596)
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.
|
|
CreditCard Validator 1.8 (Downloads: 407)
Verifies that credit card number is valid. The CreditCard Validator will help you tell:
1. if a credit card number is valid,
2. which credit card vendor handles that number.
It is a simple Applet to demonstrate the use of the ValidateCreditCard class.
It validates the prefix and the checkdigit. It does *not* contact the credit card company to ensure that number has actually been issued and that the account is in good standing.
It will also tell you which of ...
|
|
Spinner 1.1 (Downloads: 369)
DateSpinner, hex and formatted dollar input for Java JSpinner. Spinner consists of source for classes for a DateSpinner and to add hex and
formatted dollar input/output for Java JSpinner to your own
Java programs.
Spinner offers two NumberFormatter classes you can use with
a JSpinner. One is HexNumberFormatter which lets your
JSpinner range over hex values. The other is
DollarNumberFormatter which lets your JSpinner range over
dollar values. It works better than JSpinner.NumberEd...
|
|
QuickSort 1.6 (Downloads: 292)
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...
|
|
FileTransfer 2.5 (Downloads: 310)
Java classes to cop, upload and download files. Includes classes to let you copy, download and upload files from within a Java program. Also contains a command-line utility to download files.
Fully commented Java source is provided. It is now comes in four parts, MiniFileTransfer, FileTransfer and MaxiFileTransfer, Download depending on how much functionality you require. Now supports copying members in local jar files.
Command line use:
java -jar download.jar http : //x...
|
|
Converter 5.5 (Downloads: 418)
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 ...
|
|
Rgrow 1.3 (Downloads: 213)
RGrow resizes fixed length records padding or chopping. RGrow resizes fixed length records e.g.
RGrow.exe MyFile.seq 500 600
will grow each record from 500 to 600 bytes by padding binary zeros.
Will also truncate records.
These are not the old and new sizes of the file, but of the fixed length records
in the file. If you increase the record size, each record will be padded
with nulls. The entire file will grow as a result.
This program may be freely copied and us...
|
|
HeapSort 1.7 (Downloads: 252)
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:
|
|
SiteMap 1.9 (Downloads: 320)
Prepare Spidering Sitemap for Google and other search engines. You use a sitemap to encourage Google or other search
engines to more frequently and efficiently index your
website.
For overview information about Google sitemaps see:
mindprod.com/jgloss/google.html#SITEMAPS
For overview information about this utility see:
mindprod.com/jgloss/google.html#SITEMAPUTILITY.
You use this sitemap utility because it is so quick you can
use it before every upload so that...
|
|
Primes 1.4 (Downloads: 481)
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....
|
|
JarLook 1.2 (Downloads: 313)
Check that class target versions are as expected in a Java jar. Check a Java jar to make sure all the javac -target versions of
the class files are what you expect.
Java application.
Requires Java version 1.5 or later.
All Java source code is included.
to use:
java -jar jarlook.jar jartotocheck.jar 1.1 1.4
where jartocheck.jar is the name of jar to check.
It will check all the class files in it.
In this example:
1.1 is the low...
|
|
Comparators 1.4 (Downloads: 315)
Comparator classes to include in your Java programs. Java classes to include in your programs. Includes:
HTMLArrayComparator.java: Compares two arrays of Strings of HTML, ignoring embedded tags.
HTMLComparator.java: Compares two Strings of HTML, ignoring embedded tags.
StringComparator.java: Compares two Strings, case sensitive.
StringComparatorIgnoreCase.java: Compares two Strings, case insensitive.
Not useful on its own, though you can run the debugging harness with:
...
|
|
Tabin 5.3 (Downloads: 254)
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...
|
|
Align 1.6 (Downloads: 254)
Aligns data in ASCII text files into neat columns. ALIGN aligns data in ASCII text files into neat columns.
Also converts comma-delimited files to columns with 2 spaces
between each column. Input fields must be separated by
commas or white space. Fields may contain spaces if they
are enclosed in single or double quotes or C comments /* ...
*/ or //. The best way to understand this program is to try
it on a COPY of any ASCII Text file, especially one that
contains badly al...
|
|
Insult 1.9 (Downloads: 335)
Generates insults typical of those posted by Republicans in newsgroups. Generates insults typical of those posted by Republicans in
the alt.politics.bush newsgroup.
Java Applet that can also be run as an application.
You can run it without installing it at
mindprod.com/applet/insult.html
To install, Extract the zip download with WinZip, (or similar unzip utility) into
any directory you please, often C:\ -- ticking off the (user
folder names) option. To run as an application,...
|
|
Dedup 1.5 (Downloads: 231)
Java command line utility to removes duplicate lines from text files. DeDup is a Java command-line utilty for removing duplicate
lines in text files.
The dedup process compares adjacent lines only. It does not
sort first. The comparison is case sensitive. It removes
adjacent indentical lines. It replaces the original file, so
do a backup first. You can dedup 1 to N files in one
execution, just put their names on the command line.
DeDup deletes blank lines from both the beginning...
|
|
RadixSort 1.6 (Downloads: 224)
RadixSort is a fast internal sort written in Java that mimics a card sorter. RadixSort is a fast internal sort written in Java that
mimics a card sorter. Source provided. It is faster than
both HeapSort and QuickSort. It sorts using a comparision
routine you provide to compare two elements to be sorted
plus a method to extract individual bytes from the keys to
be sorted. The time to sort each item unlike most sorts,
does not increase with larger sorts. It depends rather on
the key length.
|