JSetize.cc File Reference

Example program to test JLANG::make_set method. More...

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include "JLang/JVectorize.hh"
#include "JLang/JComparison.hh"
#include "Jeep/JParser.hh"
#include "Jeep/JMessage.hh"

Go to the source code of this file.

Functions
int	main (int argc, char **argv)

Detailed Description

Example program to test JLANG::make_set method.

Author

mdejong

Definition in file JSetize.cc.

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Definition at line 75 of file JSetize.cc.

{
  using namespace std;
 
  int         debug;
 
  try {
 
    JParser<> zap("Example program to test selection of ordered data.");
 
    zap['d'] = make_field(debug)            = 3;
 
    zap(argc, argv);
  }
  catch(const exception &error) {
    FATAL(error.what() << endl);
  }
 
 
  using namespace JPP;
 
  vector<__A__> buffer;
 
  int numberOfElements = 5;
 
  for (int i = 0; i != numberOfElements; ++i) {
    buffer.push_back(__A__(i));
  }
 
  print(cout, debug, "original:", numberOfElements, buffer.data());
 
  for (int index = 0; index != numberOfElements -1; ++ index) {
 
    buffer[index].i += 1;
 
    print(cout, debug, "before:", numberOfElements, buffer.data());
 
    const int N = distance(buffer.begin(), make_set(buffer.begin(), buffer.end(), &__A__::i, JComparison::lt()));
 
    print(cout, debug, "after:", N, buffer.data());
 
    ASSERT(N == numberOfElements - 1);
 
    for (int i = 0; i != index; ++i) {
      ASSERT(buffer[i].i == i);
    }
 
    for (int i = index; i != N; ++i) {
      ASSERT(buffer[i].i == i+1);
    }
 
    buffer[N].i = index;
 
    sort(buffer.begin(), buffer.end());
  }
 
  {
    const int index = numberOfElements - 1;
 
    buffer[index].i += 1;
 
    print(cout, debug, "before:", numberOfElements, buffer.data());
 
    const int N = distance(buffer.begin(), make_set(buffer.begin(), buffer.end(), &__A__::i, JComparison::lt()));
 
    print(cout, debug, "after:", N, buffer.data());
 
    ASSERT(N == numberOfElements);
 
    buffer[index].i = index;
  }
 
  {
    const int index = 0;
 
    buffer[index].i -= 1;
 
    print(cout, debug, "before:", numberOfElements, buffer.data());
 
    const int N = distance(buffer.begin(), make_set(buffer.begin(), buffer.end(), &__A__::i, JComparison::lt()));
 
    print(cout, debug, "after:", N, buffer.data());
 
    ASSERT(N == numberOfElements);
 
    buffer[index].i = index;
  }
 
  for (int index = 1; index != numberOfElements; ++ index) {
 
    buffer[index].i -= 1;
 
    print(cout, debug, "before:", numberOfElements, buffer.data());
 
    const int N = distance(buffer.begin(), make_set(buffer.begin(), buffer.end(), &__A__::i, JComparison::lt()));
 
    print(cout, debug, "after:", N, buffer.data());
 
    ASSERT(N == numberOfElements - 1);
 
    for (int i = 0; i != index; ++i) {
      ASSERT(buffer[i].i == i);
    }
 
    for (int i = index; i != N; ++i) {
      ASSERT(buffer[i].i == i+1);
    }
 
    buffer[N].i = index;
 
    sort(buffer.begin(), buffer.end());
  }
 
  return 0;
}