Other listings by this author |
|
FileTimes 1.9 (Downloads: 262)
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...
|
|
Ini 1.4 (Downloads: 503)
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 ...
|
|
Comparators 1.4 (Downloads: 314)
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:
...
|
|
HeapSort 1.7 (Downloads: 241)
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:
|
|
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...
|
|
BOOTSave 2.8 (Downloads: 282)
BootSave saves/restores the master boot sector BootSave saves/restores the master boot sector on the
hard disk. Suite of three utilities BootSave, BootRest and
BootChk. Protects against damage to the partition table or
boot sector done by rogue programs, viruses or accidents
with tools like Norton NU.
The BootSave suite will work under DOS, Windows 3.x, Windows
95/98/ME, OS/2, but not NT, Windows 2000, XP, Vista or Windows 7.
These OSes block low level disk I/O as...
|
|
Submitter 16.4 (Downloads: 1072)
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 ...
|
|
Rgrow 1.3 (Downloads: 211)
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...
|
|
FileIO 6.1 (Downloads: 589)
Generates sample Java code to do 617 types of I/O. I/O teaching tool that generates sample Java source code to read or write the console, a sequential file, a random access file, a String, an array of characters, an array of bytes, URL, HTTP CGI GET/POST, Socket, resource or Pipe. It shows you how to read or write ASCII-8 bit characters (plain or locale-encoded), Unicode 16-bit characters, raw bytes, big endian binary, little endian binary, or serialised objects, buffered, unbuffered or gzip compressed.
|
|
VerCheck 4.4 (Downloads: 340)
VerCheck checks websites for new versions of the software you use. WHAT IT IS FOR
**************
I used to check over a dozen websites each day to see if new versions of the software I use had been released. This was time consuming and error prone. VerCheck automates this
process by checking the websites of the programs you use to see if the version numbers have changed. It comes preconfigured from the factory with 64 applications.
HOW IT WORKS
************
For each applica...
|
|
LinkedList 1.6 (Downloads: 195)
LinkedList is replacement for Java Vector class. Classical doubly linked list. LinkedList is replacement for Java Vector class. Classical
doubly linked list. Faster that Vector for insert/delete, but slower
for indexed access. The interface is modeled on java.util.Vector, so
you can try it both ways and pick which is faster for your needs.
Heavily commented Java source included. copyright (c) 1997-2008 Canadian Mind
Products. May be freely distributed and and used for any purpose
except military.
...
|
|
ShellSort 1.4 (Downloads: 231)
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...
|
|
FourTidy 3.1 (Downloads: 319)
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...
|
|
Primes 1.4 (Downloads: 479)
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....
|
|
Quoter 5.1 (Downloads: 439)
Converts text with many possible cleanups and transformations. Converts text with many possible cleanups, including
preparation of HTML and Java, aligning in columns, character
set conversion, case converting, removing excess white
space, removing blank lines, preparing regex expressions....
converts raw text with the following possible cleanups:
0. Flow text by removing newline characters. Useful to prepare text to paste into web comment boxes.
1. Convert awkward chara...
|
|
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...
|
|
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 ...
|