Other listings by this author |
|
TimeZones 1.9 (Downloads: 222)
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....
|
|
CreditCard Validator 1.8 (Downloads: 408)
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 ...
|
|
VerCheck 4.4 (Downloads: 345)
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...
|
|
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...
|
|
QuickSort 1.6 (Downloads: 299)
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...
|
|
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....
|
|
Biorhythms Calculator 2.7 (Downloads: 939)
Calculates and displays biorhythm graphs. Calculates and displays biorhythm graphs.
Enter your birthdate and this Applet and it will calculate
your biorhythms. It computes your 23-day physical, 28-day
emotional, 33-day intellectual and combined cycles. The
combined cycle is sometimes called the luck cycle. The
theory of biorhythms is when the cycles are positive/high
you will have high energy. When they are negative/low you
will have low energy. When they...
|
|
LEDataStream 1.8 (Downloads: 250)
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...
|
|
Replicator 11.3 (Downloads: 812)
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...
|
|
Pluck 1.0 (Downloads: 209)
Scans multiple files looking for a REGEX pattern, and summarised what it finds. Scans multiple files looking for a REGEX pattern, and
summarised what it finds as a CSV file.
java -jar C:\com\mindprod\pluck\pluck.jar "\.[a-z]+\." E:\temp\temp.csv E:\somedir
adjusting as necessary to account for where the jar file is.
The first parameter is the regex pattern. See regex in the java glossary
for how to compose them.
The next parameter is where the output in to go. use the
wo...
|
|
Bulk Emailer 1.7 (Downloads: 286)
The bulk emailer program sends the same email to many people. The bulk emailer program allows you to send the same email
to a long list of people. Unlike competing products, it does
not require you to run any code on your ISP's server.
The price includes customising the program to your needs.
For more detail see the manual at
mindprod.com/application/bulk.manual.html
To install, Extract the zip download with WinZip, available from
winzip.com (or similar unzip utili...
|
|
Primes 1.4 (Downloads: 482)
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....
|
|
FileIO 6.1 (Downloads: 599)
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: 256)
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:
|
|
Rgrow 1.3 (Downloads: 216)
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...
|
|
Borders 1.5 (Downloads: 245)
Displays a variety of decorative borders. Shows off what you can do with Swing. Displays a variety of decorative borders.
Shows off what you can do with Swing.
To run as an application, type:
java -jar C:\com\mindprod\borders\borders.jar
adjusting as necessary to account for where the jar file is.
The picture frame icon represents the various decorative
borders you can put around your Swing panels....
|
|
SortedArrayList 1.3 (Downloads: 238)
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 ...
|