Tag: Groovy
-
Updated: A day (wasted?) with Groovy
Update: After staying up late (after 2am after the clocks went forward), I found various bugs – I don’t know if these reflect underlying changes in the language or the JVM in the interim but it seems to work now (see GIF of the Game of Life below). Working on getting the jar done too […]
-
Your assembly is my domain-specific language
A few years ago I set out to write a clone of Sinclair BASIC as a domain-specific language (DSL) in Groovy. The end result was BINSIC, but it was much closer to an interpreter than a DSL: it turned out that strange ways that Groovy handled capitalised function/closure names meant that I could not match keywords […]
-
C, C, glorious C
This blog – The Unreasonable Effectiveness of C – is really very good, and makes a lot of points that are very difficult to argue with. Though, lately, I have (re-)discovered the joys of C++ – even if I do write code in that language like a C programmer. In the last six months I […]
-
Plunging deeper
For the last month I have been working hard on some C/C++ code to simulate a 16 core computer. I had already got some code that did this – written in Groovy – but the limitations of the Java VM made it just too difficult to write efficient code to do what I really wanted […]
-
Wanted: a better C++ book
I first taught myself C++ back in 1993 – using Borland’s Turbo C++: a great product I had lots of fun with. After that I moved on Microsoft’s Visual C++ (it was their unilateral cancellation of my subscription that marked a key stage in my disillusionment with Redmond). In those days C++ was simple – […]
-
From two years to two hundred minutes
I rewrote my parsing code in C/C++ and a task that was likely to take two years in Groovy/Java while running 18 threads – on a multicore machine with a large amount of memory – (I am not exaggerating about the turnaround time, either) completed in not much more than three hours in a single […]
-
The joy of .CXX
I have a problem. I need to parse 220GB of XML to find an OPT reference string (i.e. to profile the memory references of a running application to create a page replacement algorithm that will know which is the most efficient page replacement decision.) I had one algorithm in mind for this and I wrote […]
-
How slow is a fast computer?
I am working on a simulation environment for a NoC. The idea is that we can take a memory reference string – generated by Valgrind – and then test how long it will take to execute with different memory models for the NoC. It’s at an early stage and still quite crude. The data set […]
-
New, improved Hexxed
I have not had much luck in hunting down what is wrong with my code or the Xerces-c SAX2 parser – but I do think I have successfully updated by hex editor, Hexxed, to handle 64 bit (ie >4GB) files. Indeed it performs rather better than vi for some editing tasks (Hexxed has a vi […]
-
Free software hex editor
I have noticed that my free software hex editor (hexxed) – which is licensed under the GNU GPL – does not really come up in any searches, so here’s another entry to boost it. It’s a bit crude, but it does some things well (e.g., display unicode and switch endianness) and it will run anywhere […]
cartesian product ... stuff about computing mostly 