Other listings by this author |
|
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:
|
|
BlOut 2.6 (Downloads: 380)
Blout removes extra or all blank lines from a file. Blout removes extra blank lines from a file, collapsing multiple blank
lines down to one, (or removing them altogether with the -compact option).
It also ensures the file has a final CrLf. It also trims any blank lines
off the beginning and end of the file. It also converts all line endings
to Windows standard CrLf form. It trims trailing tabs and spaces from
each line.
Blout is not that bright. It does not understand w...
|
|
FileTransfer 2.5 (Downloads: 324)
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...
|
|
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 ...
|
|
Entities 3.1 (Downloads: 649)
Utilities to convert/strip/insert HTML/XML/XHTML entities Consists of a pair of utilities that let you
convert/strip/insert HTML/XML/XHTML entities such as _amp;- and _quot;
from files converting them back and forth to their
equivalent single characters !amp; and !quot;. It handles the HTML 4
entities such as _hearts; as well as decimal _#123; and
hexadecimal _x#123; entities.
You may us this package as standalone
utilities, or use the classes in your own programs
to...
|
|
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...
|
|
Align 1.6 (Downloads: 261)
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...
|
|
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.
...
|
|
Common13 1.3 (Downloads: 288)
common utility classes that work under Swing Java 1.3+ common utility classes that work under Swing Java 1.3+
Includes:
CMPAboutJBox: a proper about box for Swing apps/JApplets that provides useful information.
HybridJ : converts Swing Applet into an Application...
|
|
Insult 1.9 (Downloads: 339)
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,...
|
|
Compactor 3.4 (Downloads: 609)
Compresses HTML by removing unnecessary white space. Compresses HTML by removing unnecessary white space.
Compacts HTML so that web pages are 20% smaller and hence
20% faster. It does this by removing all unnecessary white
space. To fluff files up again, I suggest using SlickEdit
beautify. The file will render on browsers exactly as they
did before. Any [pre] sections are left intact. No comments
are removed.
NOTE THE COMPACTOR JUST COMPACTS YOUR HTML. IT DOES N...
|
|
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...
|
|
Screws 1.3 (Downloads: 246)
CMP Screws and Screwdrivers draws eight types of screw heads. CMP Screws and Screwdrivers draws eight types of screw
heads. It is a teaching example for how to use Java Canvas,
fillRect, fillOval, fillPoly and AffineTransform to draw.
Java source is included for you to cannibalise.
It draws 8 types of screw heads.
To run as an application, type:
java -jar C:\com\mindprod\screws\screws.jar
adjusting as necessary to account for where the jar file is....
|
|
BOOTSave 2.8 (Downloads: 290)
BootSave saves/restores the master boot sector BootSave saves/restores the master boot sector on the
hard disk. Suite of three utilities BootSave, BootRest and
BootChk. Protects against damage to the partition table or
boot sector done by rogue programs, viruses or accidents
with tools like Norton NU.
The BootSave suite will work under DOS, Windows 3.x, Windows
95/98/ME, OS/2, but not NT, Windows 2000, XP, Vista or Windows 7.
These OSes block low level disk I/O as...
|
|
QuickSort 1.6 (Downloads: 306)
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...
|
|
JarLook 1.2 (Downloads: 316)
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...
|
|
RadixSort 1.6 (Downloads: 233)
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.
|