Other listings by this author |
|
Ini 1.4 (Downloads: 512)
Windows *.ini file verifier, tidier and sorter. Windows *.ini file verifier, tidier and sorter.
Tidies and sorts windows *.ini files, ones that look like this:
[section]
; a comment
item=value;
To use:
java.exe -jar ini.jar C:\somedir\somefile.ini UTF-8
Where UTF-8 in the encoding.
Opera uses UTF-8. You can leave it to the default for most others.
The original is named somefile.ini.old when you are done.
Don't run ini ...
|
|
InWords 4.6 (Downloads: 368)
Java code to converts number to words in any of 24 languagues. Shows you how to count in any of the following languages:
Bahasa Indonesia
Binary
Decimal (several variants)
Dutch (modern, old and banker's)
English (British, North American, Ordinals)
Esperanto
French
German
Grams
Hexadecimal
Icelandic
Italian
Japanese
Martian
Metric Metric Prefixes (grams)
Norwegian
Octal
Polish
RAM (bytes)
Roman Numerals...
|
|
Sound 1.4 (Downloads: 253)
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...
|
|
Comparators 1.4 (Downloads: 318)
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:
...
|
|
Primes 1.4 (Downloads: 485)
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....
|
|
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...
|
|
Biorhythms Calculator 2.7 (Downloads: 942)
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...
|
|
Submitter 16.4 (Downloads: 1086)
Submitter will submit your PAD *.xml program descriptor file to 199 PADsites. Submitter will submit your PAD *.xml program descriptor file to 199 PADsites.
Unlike other submission programs, it submits only to PADSites
that welcome automated submissions. Compose your PAD *.xml file using a
program like PADGen, then upload it you your website. Then enter the URL
of your website directory where you upload pads and the name of the pad
itself e.g. hypotheticalprogram.xml, then hit SUBMIT. It also has a ...
|
|
Untouch 2.4 (Downloads: 448)
Reverts files dates back if the files have not really changed. Documentation on the original student project outline
mindprod.com/projects/untouchproj.html
This explains how it works and some of its uses.
Untouch supports the following command line switches which appear
before the directories.
-c or -clear = clear history first and take current file times as the new revert-to point.
-f or -force = revert files back to previous dates whether they have changed or not.
-h or -help =...
|
|
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:
|
|
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....
|
|
FileTimes 1.9 (Downloads: 275)
Read and set Windows file/dir times from Java: Create/LastModified/LastAccessed Java class library to get/set file and directory times: Create/LastModified/LastAccessed. For Windows only.
Create time is when the file was first written. Modified
time (sometimes called lastModified) is when the file was
last written. Accessed time is when the file was last read
or written. Checking its date, looking at its attributes or
checking to see if it exists does not count as reading it.
Get/Set Windows Fil...
|
|
HunkIO 1.7 (Downloads: 270)
Java classes to readEntireFile, create a temp file etc. Java classes to include in your own programs. They let you read or write a file in one fell swoop into RAM. It also includes createTempFile method that is more convenient to use than Sun's File.createTempFile. It also includes PrintWriterPlus that converts linefeeds to platform specific line feeds even when they are embedded in data.
Why the three linked ball logo? It symbolises processing a file in line-sized chunks....
|
|
Wassup 2.5 (Downloads: 474)
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...
|
|
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...
|
|
Encoding Recogniser 1.2 (Downloads: 213)
Help determine a file's encoding by displaying it wth all supported encodings. Encoding Recogniser will help you determine what encoding was
used to write a file by displaying the file in hex or and
decoded characters in any of the encodings supported by
Java.
This program runs under any OS,
(e.g. Win2K/XP/Vista/OSX/Linux/Solaris/Vista64/AIX...) so long as you have
Java version 1.5 or later installed.
To install, Extract the zip download with WinZip (or similar unzip utility) into ...
|
|
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.
|