Other listings by this author |
|
Comparators 1.4 (Downloads: 317)
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:
...
|
|
Borders 1.5 (Downloads: 251)
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....
|
|
Base64 1.9 (Downloads: 306)
Java classes to encode/decode Base64 and Base64u Base64 is a freeware way of encoding 8-bit characters using
only ASCII printable characters similar to UUENCODE.
UUENCODE embeds a filename where BASE64 does not. You will
see BASE64 used in encoding digital certificates, in
encoding user:password string in an Authorization: header
for HTTP. The spec is described in RFC 2045.
Don't confuse Base64 with x-www-form-urlencoded which
is handled by java.net.URLEncoder.encod...
|
|
CreditCard Validator 1.8 (Downloads: 410)
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 ...
|
|
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.
|
|
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...
|
|
JDisplay 4.5 (Downloads: 427)
JDisplay displays colorised program listings in web pages. JDisplay displays Java, HTML, bat, SQL, ini, csv, xml, mft
properties... files a variety of colours, fonts, sizes
and weights to help make them more presentable and readable.
Why would you use it? For the same sorts of reasons you use
colours and fonts in an IDE like IntelliJ or Eclipse. They
make the code much easier to understand.
There is no server-side code used. Java utilities parse the
code snippets i...
|
|
Wavelength 1.3 (Downloads: 295)
Wavelength creates Color objects given the light wavelength or the frequency Wavelength creates Color objects given the wavelength or
the frequency of the light rather than the usual RGB or HSB.
instead of:
Color c = new Color(255, 0, 0);
use the frequency in nanometers, and gamma 0.0. .. 1.0.
(gamma is intensity/brightness.)
Color c = Wavelength.wvColor( 400.0f, 0.80f );
The visible range of the spectrum is 380..780 nanometers.
Smaller is bluer.
or using frequency in Terahe...
|
|
Boyer 1.5 (Downloads: 262)
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...
|
|
QuickSort 1.6 (Downloads: 304)
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...
|
|
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...
|
|
Echoserver 1.3 (Downloads: 242)
See what browsers and programs are sending to an HTTP Server. See what browsers and programs are sending to an HTTP Server.
Simple server just dumps whatever it receives on the console.
Echoserver is misnamed because it does not actually echo what it receives
back to the browser....
|
|
FontSaver 1.4 (Downloads: 269)
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....
|
|
Pentium 1.5 (Downloads: 279)
Java code to tell you facts about the Pentium and AMD CPU. Pentium works on Windows and Intel Pentium class and AMD
CPUs to determine the CPUID information such as the vendor,
brand/model, step, model, instruction set family, cpu serial
number, and the RDTSC Time stamp register for high
resolution timing measured in CPU cycles since the last
boot. It is designed to be incorporated in your own Java
progams.
You can also use it as a standalone utility with:
java.ex...
|
|
Password 1.7 (Downloads: 558)
Generates random passwords that are hard to guess. Generates random passwords that are hard to guess. It uses a crytographic quality random number generator. The passwords are generated locally in a Java Applet. They are never transmitted over the Internet, even in encrypted form.
You can also run it as a standalone program, invoking it with
java com.mindprod.password.Password
or
password.jar
You can also run it online at the mindprod.com website without installing it....
|
|
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....
|
|
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:
|