Other listings by this author |
|
 Honk 1.5 (Downloads: 249)
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...
|
|
 Amper 1.9 (Downloads: 447)
Safely converts ampersands to !amp; entities In the following, pretend ! is an ampersand. PAD files don't let me give literal examples. Amper converts ! to !amp; in HTML files and back, but does not convert it when the ! is already in an entity e.g. !lt; !thetasym; !eacute;
The main use for this is to pass HTMLValidator verification of your HTML, which is very picky about !, especially inside URLs.
As a side effect, it also ensures all your comment delimiters balance.
It ...
|
|
 Compactor 3.4 (Downloads: 607)
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...
|
|
 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
...
|
|
 SetClock 8.5 (Downloads: 913)
Set your PC Clock from an accurate atomic clock on the web. Set PC Clock from an accurate atomic clock on the web. You
can put in on your website so that others can use it to
correct their clocks without having to install software or
without you having to install software on your server.
Java Web Start signed.
Requires Java version 1.5 or later. Native code for Windows only.
Full Java source code included, and native C JNI code....
|
|
 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...
|
|
 ISBN 2.5 (Downloads: 346)
Tidies, interconverts and Validates ISBN-10 and ISBN-13 book numbers. Helps you proofread, interconvert, validate and tidy ISBN-10 and ISBN-13 (International Standard Book Number) references in your HTML or other documentation. It validates the checkdigit, inserts dashes, interconverts ISBN-10 and ISBN-13. It displays them both with and without dashes....
|
|
 Align 1.6 (Downloads: 259)
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...
|
|
 QuickSort 1.6 (Downloads: 302)
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...
|
|
 Common13 1.3 (Downloads: 285)
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...
|
|
 Borders 1.5 (Downloads: 247)
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....
|
|
 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....
|
|
 RadixSort 1.6 (Downloads: 229)
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.
|
|
 CreditCard Validator 1.8 (Downloads: 409)
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 ...
|
|
 SortedArrayList 1.3 (Downloads: 241)
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 ...
|
|
 Pws 2.0 (Downloads: 236)
PWS (the pathway amanuensis) helps you with personal problems. PWS (the pathway amanuensis) helps you with personal
problems. You describe your problem and it prescribes some
sage advise based on Ken Keyes' twelve pathways from the
book Handbook To Higher Consciousness.
To install, Extract the zip download with WinZip, available from
winzip.com (or similar unzip utility) into any
directory you please, often C:\ -- ticking off the (user
folder names) option. To run as an applicat...
|
|
 HeapSort 1.7 (Downloads: 260)
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:
|
