Other listings by this author |
|
Volser 1.2 (Downloads: 375)
Gets the 4-byte 32-bit binary volume serial number in Windows. Gets the 4-byte 32-bit binary volume serial number of a Windows
disk drive assigned when it is formatted to provide and almost unique id.
Don't confuse this with the volser(, the string name,
or the manufacturer's disk serial number assigned to a hard drive at the factory.
Uses JNI and C++ native code.
Consists of java and JNI you include in your own code.
You can test with
C:
CD \com.mindprod...
|
|
Sound 1.4 (Downloads: 249)
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...
|
|
JarLook 1.2 (Downloads: 312)
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...
|
|
QuickSort 1.6 (Downloads: 281)
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...
|
|
ISBN 2.5 (Downloads: 340)
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....
|
|
Borders 1.5 (Downloads: 234)
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....
|
|
Password 1.7 (Downloads: 551)
Generates random passwords that are hard to guess. Generates random passwords that are hard to guess. It uses a crytographic quality random number generator. The passwords are generated locally in a Java Applet. They are never transmitted over the Internet, even in encrypted form.
You can also run it as a standalone program, invoking it with
java com.mindprod.password.Password
or
password.jar
You can also run it online at the mindprod.com website without installing it....
|
|
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....
|
|
LEDataStream 1.8 (Downloads: 247)
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...
|
|
Compactor 3.4 (Downloads: 579)
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...
|
|
SiteMap 1.9 (Downloads: 319)
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...
|
|
FontShower 2.9 (Downloads: 498)
Displays all the fonts available to Swing in Java. Displays all the fonts available to Java on your
machine. Displays the fonts in a variety of styles, sizes
and colours, rendered either with anti-aliased or plain.
FontShower displays the fonts available on *your* machine
to *Java*. Other people will have different fonts installed
and will see different selections available via Java on
their machines. Your browser will see a slightly different
set of fonts than Java ...
|
|
Pentium 1.5 (Downloads: 277)
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...
|
|
Transporter 1.4 (Downloads: 247)
Lightweight Java classes to let you encrypt/sign/armour for secure transmission. The Transporter acts like an electronic secure courier to
deliver your data and documents in encrypted form safe from
prying eyes or those who would tamper with them.
It Encrypts, digitally signs and armours to send sensitive
information over the Internet without SSL.
Typically you would embed it in your own Internet
applications....
|
|
SortedArrayList 1.3 (Downloads: 233)
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: 376)
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...
|
|
RadixSort 1.6 (Downloads: 216)
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.
|