Skip to main content

Counted Method Chaining

I built a fun set of classes using C++ template meta-programming technique to count the number of times a member method of a class is invoked in a chain. These template classes implement a meta-programming technique called Counted Method Chaining. It counts the number of times a member function is called at compile-time and does not let programmer invoke it more than a used defiend limit. The limit is passed as a integer template parameter to the class to which to method belongs. It gives a compile time error only when method chaining is used. Otherwise it throws and exception. These set of classes use the C++ technique of co-variant return types.

/// @brief A genereral case of the template where add function
/// is public and therefore, it can be invoked.
template <unsigned int C>
class Base : public Base <C-1>
{
public:
virtual Base <C-1> & add (void const *, size_t length) = 0;
};

/// @brief The special case of the template when C (count) becomes zero.
/// The add member function is private and therefore, can't be
/// invoked by the client of the class resulting in a compile time error.
template <>
class Base <0>
{
public:
virtual ~Base () {}
private:
virtual Base <0> & add (void const *, size_t length) = 0;
};

template <unsigned int SIZE>
class IOV_Helper : public Base <SIZE-1>
{
public:
/// @brief Constructor: Makes a IOV_Helper object.
IOV_Helper () : count_(0) {}

/// @brief Adds a buffer pointer and its size to be sent over network later
/// using gather write technique.
Base <SIZE-1> & add (void const *ptr, size_t length)
{
if (0 == length)
return *this;

if (count_ >= SIZE)
throw count_ + 1;

iov_[count_].iov_base = const_cast <void *> (ptr);
iov_[count_].iov_len = length;
++count_;

return *this;
}

/// @brief Returns the number of I/O vectors populated currently
unsigned int size () { return count_; }

/// @brief Sends the data in the I/O vectors out to a remote peer.
int send (ACE_SOCK_Stream &out)
{
return out.sendv_n (iov_, count_);
}

private:
iovec iov_[SIZE]; /// @brief I/O vectors array.
unsigned int count_; /// @brief count of the number vectors added.
};

int main (void)
{
IOV_Helper <2> sender; /// Here 2 is the maximum limit of method chaining.
char * data = new char[20];
sender.add(data, 20).add(data, 20); /// OK
sender.add(data, 20).add(data, 20).add(data, 20); /// Compile-time Error
return 0;
}

Comments

Sudarshan said…
Long time no posts how are you?
Check out this blog
http://pkisensee.spaces.live.com/

interesting C++ information

Popular Content

Multi-dimensional arrays in C++11

What new can be said about multi-dimensional arrays in C++? As it turns out, quite a bit! With the advent of C++11, we get new standard library class std::array. We also get new language features, such as template aliases and variadic templates. So I'll talk about interesting ways in which they come together.

It all started with a simple question of how to define a multi-dimensional std::array. It is a great example of deceptively simple things. Are the following the two arrays identical except that one is native and the other one is std::array?

int native[3][4];
std::array<std::array<int, 3>, 4> arr;

No! They are not. In fact, arr is more like an int[4][3]. Note the difference in the array subscripts. The native array is an array of 3 elements where every element is itself an array of 4 integers. 3 rows and 4 columns. If you want a std::array with the same layout, what you really need is:

std::array<std::array<int, 4>, 3> arr;

That's quite annoying for two r…

Inheritance vs std::variant

C++17 added std::variant and std::visit in its repertoire. They are worth a close examination. I've been wondering about whether they are always better than inheritance for modeling sum-types (fancy name for discriminated unions) and if not, under what circumstances they are not. We'll compare the two approaches in this blog post. So here it goes.

Inheritancestd::variantNeed not know all the derived types upfront (open-world assumption)Must know all the cases upfront (closed-world assumption)Dynamic Allocation (usually)No dynamic allocationIntrusive (must inherit from the base class)Non-intrusive (third-party classes can participate)Reference semantics (think how you copy a vector of pointers to base class?)Value semantics (copying is trivial)Algorithm scattered into classesAlgorithm in one placeLanguage supported (Clear errors if pure-virtual is not implemented)Library supported (poor error messages)Creates a first-class abstractionIt’s just a containerKeeps fluent interfaces…

Covariance and Contravariance in C++ Standard Library

Covariance and Contravariance are concepts that come up often as you go deeper into generic programming. While designing a language that supports parametric polymorphism (e.g., templates in C++, generics in Java, C#), the language designer has a choice between Invariance, Covariance, and Contravariance when dealing with generic types. C++'s choice is "invariance". Let's look at an example.
struct Vehicle {}; struct Car : Vehicle {}; std::vector<Vehicle *> vehicles; std::vector<Car *> cars; vehicles = cars; // Does not compile The above program does not compile because C++ templates are invariant. Of course, each time a C++ template is instantiated, the compiler creates a brand new type that uniquely represents that instantiation. Any other type to the same template creates another unique type that has nothing to do with the earlier one. Any two unrelated user-defined types in C++ can't be assigned to each-other by default. You have to provide a c…