3
0
mirror of https://github.com/triqs/dft_tools synced 2024-12-27 06:43:40 +01:00
dft_tools/test/triqs/arrays/lexico_vector.cpp
Olivier Parcollet f2c7d449cc First commit : triqs libs version 1.0 alpha1
for earlier commits, see TRIQS0.x repository.
2013-07-17 19:24:07 +02:00

62 lines
1.8 KiB
C++

/*******************************************************************************
*
* TRIQS: a Toolbox for Research in Interacting Quantum Systems
*
* Copyright (C) 2011 by O. Parcollet
*
* TRIQS is free software: you can redistribute it and/or modify it under the
* terms of the GNU General Public License as published by the Free Software
* Foundation, either version 3 of the License, or (at your option) any later
* version.
*
* TRIQS is distributed in the hope that it will be useful, but WITHOUT ANY
* WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
* details.
*
* You should have received a copy of the GNU General Public License along with
* TRIQS. If not, see <http://www.gnu.org/licenses/>.
*
******************************************************************************/
#include "./common.hpp"
#include <iostream>
#include <algorithm>
#include "./src/array.hpp"
#include "./src/vector.hpp"
#include "./src/matrix.hpp"
#include "./src/asserts.hpp"
using namespace triqs::arrays;
int main(int argc, char **argv) {
#ifndef TRIQS_WORKAROUND_INTEL_COMPILER_BUGS
{
vector<double> a = { 1,3,2}, b= {2,3,1};
assert_is_true (std::lexicographical_compare(a.begin(), a.end(), b.begin(), b.end()));
assert_is_false (std::lexicographical_compare(b.begin(), b.end(), a.begin(), a.end()));
assert_is_true (a<b);
assert_is_false (b<a);
}
{
vector<double> a = {1,3,2}, b= {1,2,10};
assert_is_false (std::lexicographical_compare(a.begin(), a.end(), b.begin(), b.end()));
assert_is_true (std::lexicographical_compare(b.begin(), b.end(), a.begin(), a.end()));
assert_is_true (b<a);
assert_is_false (a<b);
}
{
vector<int> a = {1,3,2}, b=a;
assert_is_false (a<b);
}
#endif
}