I was working on specifying separate mixin and interface types, when I remembered Scala Traits / Ruby Modules.

I believe interfaces are important enough to warrant a categorization of IOPL's (Interface Oriented Programming Languages). Here's my attempt to describe them.

I have just released a new version of the OOTL which contains a VList based implementation of a stack data-type and a hash table data-type.

From Wikipedia: "Hash tables are not persistent data structures, in the sense that there is no simple space-efficient way to update a hash table while retaining access to the previous copy of the hash table.". This is false, and Wikipedia should know why.

The growable array I posted about two days ago has evolved into a full-featured stack template class with more features, more tests, better performance and contract verification.

I have just developed a growable array class as part of the OOTL, which outperforms std::vector on calls to push_back() by a factor of 2.5 on my installation of GCC.

The C++ Cookbook, which I cowrote with Ryan Stephens, Jonathan Turkanis, and Jeff Cogswell, is now for sale at Amazon.com and other book sellers.

The Iterable concept is an extremely abstract way to treat a collection functionally, without worrying about indexers or iterators.

Ostream iterators are a handy but under-utilized tool for using the STL to output containers and ranges. Here I provide an alternative, which has a more pleasing syntax.

In the STL there exist numerous concepts such as Random Access Containers, and Back Insertion Sequences. Boost has introduced several improved Range concepts. I've got a new one for the list, the Iterable concept.

I have come up with a first specification of OsXml, an XML schema for publishing and distributing Open-Source code.

Wouldn't it be nice if there existed a standard for XML when you don't need the whole thing? I propose a strict subset of XML called XML minus minus (XML--).

A concept is a description of a type, including functions signatures, preconditions, postconditions, invariants, and member types. In C++ it is an abstract idea, but in the next Heron it will exist as a construct. There is one small problem with the syntax when writing function signatures which use concepts.

An enormous amount of data can be conveniently represented as a labelled tree. This is the basis of many markup languages such as SGML, XML, HTML, and others. Herein I propose an alternative, Labelled S-Expressions and provide code for a working parser in C++.

I have devised a simple mark-up scheme for my own purposes which is much simpler than XML.