1. Example 1: sets of integers
We're going to create a class called set_int for manipulating sets of integers. We'll provide the following operators (e denotes an element of type set_int and n an integer):
<<, such that e<
%, such that n % e values 1 if n belongs to e and 0 otherwise ;
<<, such that flot << e sends the contents of set e to the indicated flot, in the form :
[integer_1, integer_2, ... integer_n]
The cardinal member function provides the number of elements in the set.
To keep the example simple, the maximum number of integers that the set can contain is specified in the constructor, which dynamically allocates the necessary space.
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Example 1: sets of integers