mirror of
https://github.com/GothenburgBitFactory/taskwarrior.git
synced 2025-06-26 10:54:26 +02:00
130 lines
5 KiB
C++
130 lines
5 KiB
C++
////////////////////////////////////////////////////////////////////////////////
|
|
// taskwarrior - a command line task list manager.
|
|
//
|
|
// Copyright 2006-2013, Paul Beckingham, Federico Hernandez.
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
// of this software and associated documentation files (the "Software"), to deal
|
|
// in the Software without restriction, including without limitation the rights
|
|
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the Software is
|
|
// furnished to do so, subject to the following conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be included
|
|
// in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
|
|
// THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
// SOFTWARE.
|
|
//
|
|
// http://www.opensource.org/licenses/mit-license.php
|
|
//
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|
|
#include <iostream>
|
|
#include <Context.h>
|
|
#include <main.h>
|
|
#include <test.h>
|
|
|
|
Context context;
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
int main (int argc, char** argv)
|
|
{
|
|
UnitTest t (24);
|
|
|
|
// 1,2,3 <=> 2,3,4
|
|
std::vector <std::string> string_one;
|
|
string_one.push_back ("1");
|
|
string_one.push_back ("2");
|
|
string_one.push_back ("3");
|
|
|
|
std::vector <std::string> string_two;
|
|
string_two.push_back ("2");
|
|
string_two.push_back ("3");
|
|
string_two.push_back ("4");
|
|
|
|
std::vector <std::string> string_three;
|
|
string_three.push_back ("2");
|
|
string_three.push_back ("3");
|
|
string_three.push_back ("4");
|
|
|
|
std::vector <std::string> string_four;
|
|
|
|
// Differences?
|
|
t.ok (!listDiff (string_one, string_one), "std::string (1,2,3) == (1,2,3)");
|
|
t.ok (listDiff (string_one, string_two), "std::string (1,2,3) != (2,3,4)");
|
|
t.ok (listDiff (string_one, string_three), "std::string (1,2,3) != (2,3,4)");
|
|
t.ok (listDiff (string_one, string_four), "std::string (1,2,3) != ()");
|
|
t.ok (!listDiff (string_four, string_four), "std::string () == ()");
|
|
|
|
// What are the differences?
|
|
std::vector<std::string> string_leftOnly;
|
|
std::vector<std::string> string_rightOnly;
|
|
listDiff (string_one, string_two, string_leftOnly, string_rightOnly);
|
|
t.is ((int) string_leftOnly.size (), 1, "std::string (1,2,3) <=> (2,3,4) = 1<-");
|
|
t.is (string_leftOnly[0], "1", "std::string (1,2,3) <=> (2,3,4) = 1<-");
|
|
|
|
t.is ((int) string_rightOnly.size (), 1, "std::string (1,2,3) <=> (2,3,4) = ->4");
|
|
t.is (string_rightOnly[0], "4", "std::string (1,2,3) <=> (2,3,4) = ->4");
|
|
|
|
// What is the intersection?
|
|
std::vector <std::string> string_join;
|
|
listIntersect (string_one, string_two, string_join);
|
|
t.is ((int) string_join.size (), 2, "std::string (1,2,3) intersect (2,3,4) = (2,3)");
|
|
t.is (string_join[0], "2", "std::string (1,2,3) intersect (2,3,4) = (2,3)");
|
|
t.is (string_join[1], "3", "std::string (1,2,3) intersect (2,3,4) = (2,3)");
|
|
|
|
// Now do it all again, with integers.
|
|
|
|
// 1,2,3 <=> 2,3,4
|
|
std::vector <int> int_one;
|
|
int_one.push_back (1);
|
|
int_one.push_back (2);
|
|
int_one.push_back (3);
|
|
|
|
std::vector <int> int_two;
|
|
int_two.push_back (2);
|
|
int_two.push_back (3);
|
|
int_two.push_back (4);
|
|
|
|
std::vector <int> int_three;
|
|
int_three.push_back (2);
|
|
int_three.push_back (3);
|
|
int_three.push_back (4);
|
|
|
|
std::vector <int> int_four;
|
|
|
|
// Differences?
|
|
t.ok (!listDiff (int_one, int_one), "int (1,2,3) == (1,2,3)");
|
|
t.ok (listDiff (int_one, int_two), "int (1,2,3) != (2,3,4)");
|
|
t.ok (listDiff (int_one, int_three), "int (1,2,3) != (2,3,4)");
|
|
t.ok (listDiff (int_one, int_four), "int (1,2,3) != ()");
|
|
t.ok (!listDiff (int_four, int_four), "int () == ()");
|
|
|
|
// What are the differences?
|
|
std::vector<int> int_leftOnly;
|
|
std::vector<int> int_rightOnly;
|
|
listDiff (int_one, int_two, int_leftOnly, int_rightOnly);
|
|
t.is ((int) int_leftOnly.size (), 1, "int (1,2,3) <=> (2,3,4) = 1<-");
|
|
t.is (int_leftOnly[0], "1", "int (1,2,3) <=> (2,3,4) = 1<-");
|
|
|
|
t.is ((int) int_rightOnly.size (), 1, "int (1,2,3) <=> (2,3,4) = ->4");
|
|
t.is (int_rightOnly[0], "4", "int (1,2,3) <=> (2,3,4) = ->4");
|
|
|
|
// What is the intersection?
|
|
std::vector <int> int_join;
|
|
listIntersect (int_one, int_two, int_join);
|
|
t.is ((int) int_join.size (), 2, "int (1,2,3) intersect (2,3,4) = (2,3)");
|
|
t.is (int_join[0], "2", "int (1,2,3) intersect (2,3,4) = (2,3)");
|
|
t.is (int_join[1], "3", "int (1,2,3) intersect (2,3,4) = (2,3)");
|
|
|
|
return 0;
|
|
}
|
|
|
|
////////////////////////////////////////////////////////////////////////////////
|
|
|