Tagged: GNU General Public License

Hexxed usage options


So, you want a hex editor for your latest project and (naturally) you decide to have a look at Hexxed, the free, GPL licensed, hex editor you can download here: http://88.198.44.150/hexxed.jar. So what happens next?

bash-3.2$ java -jar hexxed.jar -u

usage: hexxed [options]
-b,–block use block:offset address output – default is
linear address
-be,–bigendian interpret data as big endian – default is cpu
endianness
-f,–file <arg> file to edit
-le,–littleendian interpret data as little endian – default is cpu
endianness
-o,–offset <arg> offset in file – default 0
-s,–blocksize <arg> size of block if block:offset addressing used -
default is 0×200
-u,–usage show this information
-w,–width <arg> width (in bits, 8 – 64 bits) of output data -
default is 8 bits
-x,–x <arg> width of window (default 640 pixels)
-y,–y <arg> height of window (default 480 pixels)

Subtext is, please do have a look at Hexxed. I know it’s not as fully featured as commercial or even other free hex editors, but this is just the first iteration and if you tell me it is useful and add what feature you’d like to see in it, it is quite likely that I will get on with adding it.

Update: I have now run Hexxed on Ubuntu and Debian Linux, Mac OSX and Windows XP, so it should work on anything with Java installed.

Red black tree resources and sources


My earlier article about red-black trees seems to have attracted some interest, so I thought I’d do another one just listing some resources.

The most cited text on this issue is Introduction to Algorithms though you don’t need it to implement your own red-black tree. Some useful internet sources are:

This animation gives you a good idea about how your tree should work.

And this video (based on the book) is pretty essential viewing.


Lecture 10: Red-black Trees, Rotations, Insertions, Deletions – Erik Demaine

If you want sources:

My C++ implementation of a red-black tree (GPL licensed)

The C++ standard template library offers various red-black tree based container classes: explained in this Dr Dobb’s Journal article.

The Linux kernel has a C implementation of a red-black tree – read here for more about that. The implementation can be found in the kernel sources at /include/linux/rbtree.h

Related Articles