Skip to content

eugnsp/CUJ

Repository files navigation

The C/C++ Users Journal

1992

February – Volume 10, Number 2

April – Volume 10, Number 4

December – Volume 10, Number 12


1993

February – Volume 11, Number 2


1994

January – Volume 12, Number 1

April – Volume 12, Number 4

October – Volume 12, Number 10


1995

March 1995 – Volume 13, Number 3

  • Bob Stout. “Olympic” Filtering for Noisy Data
    Sometimes the simplest techniques yield surprisingly good results. When it comes to filtering input data on a small embedded system, simplicity is a major virtue.

  • Blase B. Cindric. When the “Best” Algorithm Isn’t
    Knowledge is power, particularly when choosing an algorithm. The more you know about your data, the better you can tailor how you manipulate it for better performance.

April 1995 – Volume 13, Number 4

July 1995 – Volume 13, Number 7

1996

January 1996 – Volume 14, Number 1

October 1996 – Volume 14, Number 10


1997

January 1997 – Volume 15, Number 1

March 1997 – Volume 15, Number 3

  • Rodney B. Doe, P.E. How to Leak Memory in C++
    Warning: These are untrained professionals at work here. Do not try this at home.

May 1997 – Volume 15, Number 5


1998

January – Volume 16, Number 1

August – Volume 16, Number 8

  • James M. Curran. Creating a Word Iterator
    Iterators can do more than just step through data. They can, for example, do a bit of parsing along the way.

September – Volume 16, Number 9

  • Thomas Becker. Smart Iterators and STL
    Because they’re templates, you can smuggle added functionality into STL algorithms all sorts of ways, even through iterators.

November – Volume 16, Number 11


1999

January – Volume 17, Number 1

  • Radoslav Getov. Persistent Vector Iterators
    Template class vector has some annoying properties. But you can hide them, and still make use of the good stuff, by deriving another template class from vector.

August – Volume 17, Number 8

  • P. J. Plauger. Standard C/C++: A Better List
    How hard can it be to maintain a linked list? You'd be surprised. Our Senior Editor certainly was.

2000

January – Volume 18, Number 1

  • Yogi Dandass. Interval Trees
    We know that a tree is often a good way to represent an ordered set of values. It can also be a good way to order a set of ranges as well.

February – Volume 18, Number 2

October – Volume 18, Number 10

About

The C/C++ Users Journal

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published