Other listings by this author |
|
Encoding Recogniser 1.2 (Downloads: 210)
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 ...
|
|
Holiday Calculatior 4.7 (Downloads: 732)
Calculate when 66 holidays occur in any given year. Calculates when various holidays occur in any given year BC or AD.
Designed to be cannibalised to include the calculation routines in your
own programs. You might use it to prepare paper calenders well in
advance or electronic calendars. You might also use the logic in computer
programs that compute payrolls, bus schedules, or club meetings. You
might use it in writing novels or researching historical events. It can
als...
|
|
TimeZones 1.9 (Downloads: 220)
Displays all the TimeZone on your machine supported by Java Displays all the TimeZoneon your machine supported by
Java, with their standard time and daylight saving time
offsets from GMT, along with the their ID (programmer) names
and display names. It also displays UTC time, local time, and
your default TimeZone and whether daylight savings is
currently in effect....
|
|
QuickSort 1.6 (Downloads: 270)
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...
|
|
Encodings 1.6 (Downloads: 248)
Applet to list all supported encodings (character sets) supported by Java. Applet to list all supported encodings (character sets)
supported by your browser/java.
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, type:
java -jar C:\com\mindprod\encodings\encodings.jar
adjusting as necessary to account for where the jar file is....
|
|
Spinner 1.1 (Downloads: 353)
DateSpinner, hex and formatted dollar input for Java JSpinner. Spinner consists of source for classes for a DateSpinner and to add hex and
formatted dollar input/output for Java JSpinner to your own
Java programs.
Spinner offers two NumberFormatter classes you can use with
a JSpinner. One is HexNumberFormatter which lets your
JSpinner range over hex values. The other is
DollarNumberFormatter which lets your JSpinner range over
dollar values. It works better than JSpinner.NumberEd...
|
|
SiteMap 1.9 (Downloads: 317)
Prepare Spidering Sitemap for Google and other search engines. You use a sitemap to encourage Google or other search
engines to more frequently and efficiently index your
website.
For overview information about Google sitemaps see:
mindprod.com/jgloss/google.html#SITEMAPS
For overview information about this utility see:
mindprod.com/jgloss/google.html#SITEMAPUTILITY.
You use this sitemap utility because it is so quick you can
use it before every upload so that...
|
|
FileTimes 1.9 (Downloads: 256)
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...
|
|
Primes 1.4 (Downloads: 477)
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....
|
|
Align 1.6 (Downloads: 252)
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...
|
|
Wassup 2.5 (Downloads: 468)
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...
|
|
LEDataStream 1.8 (Downloads: 246)
Little-endian replacements for DataInputStream, DataOutputStream and RandomAcces Little-endian replacements for DataInputStream, DataOutputStream and RandomAccessFile. They work just like DataInputStream, DataOutputStream and RandomAccessFile except they work with little-endian binary data. Normally Java binary I/O is done with big-endian data, with the most significant byte of an integer or float first. Intel and Windows 95 tend to work with little endian data in native files. LEDataInputStream, LEDataOutputstream and LERandomAccessFile will le...
|
|
ShellSort 1.4 (Downloads: 230)
ShellSort is a simple sort suitable for 2000 or less elements. ShellSort is a simple sort suitable for 2000 or less
elements. It sorts using a comparision routine you provide
to compare two elements to be sorted.
You can test it with:
java.exe com.mindprod.shellsort.TestShellSort...
|
|
Pluck 1.0 (Downloads: 204)
Scans multiple files looking for a REGEX pattern, and summarised what it finds. Scans multiple files looking for a REGEX pattern, and
summarised what it finds as a CSV file.
java -jar C:\com\mindprod\pluck\pluck.jar "\.[a-z]+\." E:\temp\temp.csv E:\somedir
adjusting as necessary to account for where the jar file is.
The first parameter is the regex pattern. See regex in the java glossary
for how to compose them.
The next parameter is where the output in to go. use the
wo...
|
|
JDisplay 4.5 (Downloads: 419)
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...
|
|
FourTidy 3.1 (Downloads: 317)
Tidies Take Command/TCC/4NT/4DOS DESCRIBE file descriptors To tidy, sort, prune and dedup a JP Software
Take Command/TCC/4NT/4DOS hidden descript.ion file. These files are used by
the DESCRIBE utility to track what your various files
are for.
First make the directory containing the usually-hidden descript.ion file
current. e.g.
C:
cd \env
Then invoke the java program with:
java.exe -jar C:\com\mindprod\fourtidy\fourtidy.jar
If you...
|
|
HeapSort 1.7 (Downloads: 237)
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:
|