Other listings by this author |
|
Accumulate 1.3 (Downloads: 198)
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....
|
|
Honk 1.5 (Downloads: 250)
Plays one or more of the Standard Windows sounds or wav files. Plays one or more of the Standard Windows sounds, triggered
purely from the command line.
use:
honk
- Plays the default system sound.
honk SystemStart SystemHand SystemQuestion
- Plays the given list of standard system sounds (usually just one).
- they are case-insensitive (you can get the case wrong and it will still work).
Possible sound names are listed in the registry...
|
|
Rgrow 1.3 (Downloads: 217)
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...
|
|
Boyer 1.5 (Downloads: 264)
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...
|
|
HeapSort 1.7 (Downloads: 272)
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:
|
|
Replicator 11.3 (Downloads: 820)
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...
|
|
Batik 2.2 (Downloads: 527)
Java to let you create a custom utility to find and delete all junk files. Java classes to let you create a custom utility to find and
delete all junk files on your machine. Use one of the three
scripts supplied as an example, to create your own XXX.java
source code file then compile and use to rapidly clean your
drive of junk.
This program requires some elementary Java programming skill.
To compile
E:
cd \com\mindprod\batik
javac *.java
to run, make s...
|
|
Align 1.6 (Downloads: 265)
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...
|
|
FontSaver 1.4 (Downloads: 280)
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....
|
|
JarCheck 1.4 (Downloads: 545)
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 jarcheck.jar jartotocheck.jar 1.1 1.7
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 lo...
|
|
Mouse 1.4 (Downloads: 278)
In Java, allows you to find out where the mouse in on the screen In Java, allows you to find out where the mouse in on the
screen, even when it is not over one of your apps. This has
similar function to MouseInfo.getPointerInfo in Java 1.5+.
This class will work in any version of Java.
It uses JNI and a DLL, so it only works on Windows.
You must install the nativemouse.dll somewhere on the path.
Then your programs can find out the x and y position of the
mouse, [(0,0...
|
|
Sound 1.4 (Downloads: 255)
Create/synthesize sounds mathematically in Java. Sound lets you mathematically create sounds in Java.
You define your sounds in terms of 16-bit linear code for
the waveform, -- an array of samplings. The U_Law.class will
then convert that to (or from) *.AU mu-law 8-bit encoding
format which you can then play with
AudioPlayer.player.start(bis) in an application or with
Applet.getAudioClip in an Applet.
This is just a sample program. You would insert your own m...
|
|
CMOSSave 4.6 (Downloads: 349)
Check CMOS for corruption and automatically restore it. CMOSSave CMOSRest CMOSChk restore corrupted CMOS from
backup and check that CMOS has not been tampered with.
Naive users sometimes meddle with CMOS settings. We need a
fast way to put the scores of subtle CMOS configuration
settings back the way they were.
Power surges can corrupt CMOS. We need a way for a naive
user to quickly restore all the CMOS settings.
If the battery fails, the contents will be los...
|
|
Wassup 2.5 (Downloads: 477)
Wassup let's you know what's up with your Java environment. Wassup let's you know what's up with your Java environment.
It will tell you the System Properties, as many as the
Security system will let you peek at. This includes such
things as which JVM is running, which version of Java, which
vendor. It may be run as either an Applet or an application.
When you run Wassup as an application it shows you
considerably more information. The Java sandbox considers it
a security risk to rev...
|
|
SortedArrayList 1.3 (Downloads: 247)
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 ...
|
|
Splice 1.5 (Downloads: 463)
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...
|
|
QuickSort 1.6 (Downloads: 311)
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...
|