jyapayne/swig
Watch
1
0
Fork
You've already forked swig
 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Combine duplicate unordered_set unordered_map testcases

Browse source 
Merge cpp11_li_std_unordered_map into cpp11_std_unordered_map
Merge cpp11_li_std_unordered_set into cpp11_std_unordered_set
This commit is contained in:
William S Fulton 2019-02-12 06:36:01 +00:00
commit 82d1632071
7 changed files with 16 additions and 33 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Examples/test-suite/cpp11_li_std_unordered_map.i
View file

@ -1,11 +0,0 @@
/*
* A test of unordered_map containers.
*/
%module cpp11_li_std_unordered_map
%include <std_string.i>
%include <std_unordered_map.i>
%template(IntIntUnorderedMap) std::unordered_map<int, int>;
%template(StringIntUnorderedMap) std::unordered_map<std::string, int>;

10
Examples/test-suite/cpp11_li_std_unordered_set.i
View file

@ -1,10 +0,0 @@
/*
* A test of unordered_set containers.
*/
%module cpp11_li_std_unordered_set
%include <std_string.i>
%include <std_unordered_set.i>
%template(StringUnorderedSet) std::unordered_set<std::string>;

2
Examples/test-suite/cpp11_std_unordered_map.i
View file

@ -1,5 +1,7 @@
%module cpp11_std_unordered_map
%include <std_string.i>
%include <std_unordered_map.i>
%template(UnorderedMapIntInt) std::unordered_map<int, int>;
%template(UnorderedMapStringInt) std::unordered_map<std::string, int>;

2
Examples/test-suite/cpp11_std_unordered_set.i
View file

@ -1,5 +1,7 @@
%module cpp11_std_unordered_set
%include <std_string.i>
%include <std_unordered_set.i>
%template(UnorderedSetInt) std::unordered_set<int>;
%template(UnorderedSetString) std::unordered_set<std::string>;

4
Examples/test-suite/java/Makefile.in
View file

@ -53,9 +53,9 @@ CPP11_TEST_CASES = \
cpp11_shared_ptr_nullptr_in_containers \
cpp11_shared_ptr_overload \
cpp11_shared_ptr_upcast \
cpp11_std_unordered_map \
cpp11_std_unordered_set \
cpp11_strongly_typed_enumerations_simple \
cpp11_li_std_unordered_map \
cpp11_li_std_unordered_set \
DOXYGEN_TEST_CASES := \
doxygen_parsing_enums_simple \

122
Examples/test-suite/java/cpp11_std_unordered_map_runme.java Normal file
View file

@ -0,0 +1,122 @@
import cpp11_std_unordered_map.*;
public class cpp11_std_unordered_map_runme {
static {
try {
System.loadLibrary("cpp11_std_unordered_map");
} catch (UnsatisfiedLinkError e) {
System.err.println("Native code library failed to load. See the chapter on Dynamic Linking Problems in the SWIG Java documentation for help.\n" + e);
System.exit(1);
}
}
public static void checkThat(boolean mustBeTrue) throws Throwable {
if (!mustBeTrue) {
// Index [2], since this function is one hop away from main, and [1] is the current method.
throw new RuntimeException("Test failed at line number " + Thread.currentThread().getStackTrace()[2].getLineNumber());
}
}
public static void main(String argv[]) throws Throwable
{
java.util.AbstractMap<String, Integer> sim = new UnorderedMapStringInt();
java.util.AbstractMap<Integer, Integer> iim = new UnorderedMapIntInt();
checkThat(sim.isEmpty());
checkThat(iim.isEmpty());
checkThat(sim.size() == 0);
checkThat(iim.size() == 0);
checkThat(sim.get("key") == null);
checkThat(iim.get(1) == null);
checkThat(!sim.containsKey("key"));
checkThat(!iim.containsKey(1));
checkThat(sim.put("key", 2) == null);
checkThat(iim.put(1, 2) == null);
checkThat(sim.size() == 1);
checkThat(iim.size() == 1);
checkThat(!sim.isEmpty());
checkThat(!iim.isEmpty());
checkThat(sim.get("key") == 2);
checkThat(iim.get(1) == 2);
checkThat(sim.remove("key") == 2);
checkThat(iim.remove(1) == 2);
checkThat(sim.isEmpty());
checkThat(iim.isEmpty());
checkThat(sim.size() == 0);
checkThat(iim.size() == 0);
checkThat(sim.get("key") == null);
checkThat(iim.get(1) == null);
checkThat(sim.remove("key") == null);
checkThat(iim.remove(1) == null);
checkThat(sim.put("key", 2) == null);
checkThat(iim.put(1, 2) == null);
sim.clear();
iim.clear();
checkThat(sim.isEmpty());
checkThat(iim.isEmpty());
checkThat(sim.put("key1", 1) == null);
checkThat(iim.put(1, 1) == null);
checkThat(sim.put("key2", 2) == null);
checkThat(iim.put(2, 2) == null);
checkThat(sim.size() == 2);
checkThat(iim.size() == 2);
checkThat(sim.get("key1") == 1);
checkThat(iim.get(1) == 1);
checkThat(sim.get("key2") == 2);
checkThat(iim.get(2) == 2);
checkThat(sim.put("key1", 3) == 1);
checkThat(iim.put(1, 3) == 1);
checkThat(sim.size() == 2);
checkThat(iim.size() == 2);
checkThat(sim.get("key1") == 3);
checkThat(iim.get(1) == 3);
java.util.Set<java.util.Map.Entry<String, Integer>> sim_es = sim.entrySet();
java.util.Map<String, Integer> sim_default = new java.util.HashMap<String, Integer>();
sim_default.put("key1", 3);
sim_default.put("key2", 2);
java.util.Set<java.util.Map.Entry<String, Integer>> sim_es_default = sim_default.entrySet();
checkThat(sim_es.size() == sim_es_default.size());
for (java.util.Map.Entry<String, Integer> entry : sim_es) {
checkThat(sim_es_default.contains(entry));
checkThat(sim_default.containsKey(entry.getKey()));
checkThat(sim_default.containsValue(entry.getValue()));
Integer oldValue = entry.getValue();
entry.setValue(oldValue + 1);
checkThat(sim.get(entry.getKey()) == (oldValue + 1));
}
java.util.Set<java.util.Map.Entry<Integer, Integer>> iim_es = iim.entrySet();
java.util.Map<Integer, Integer> iim_default = new java.util.HashMap<Integer, Integer>();
iim_default.put(1, 3);
iim_default.put(2, 2);
java.util.Set<java.util.Map.Entry<Integer, Integer>> iim_es_default = iim_default.entrySet();
checkThat(iim_es.size() == iim_es_default.size());
for (java.util.Map.Entry<Integer, Integer> entry : iim_es) {
checkThat(iim_es_default.contains(entry));
checkThat(iim_default.containsKey(entry.getKey()));
checkThat(iim_default.containsValue(entry.getValue()));
Integer oldValue = entry.getValue();
entry.setValue(oldValue + 1);
checkThat(iim.get(entry.getKey()) == (oldValue + 1));
}
}
}

75
Examples/test-suite/java/cpp11_std_unordered_set_runme.java Normal file
View file

@ -0,0 +1,75 @@
import cpp11_std_unordered_set.*;
public class cpp11_std_unordered_set_runme {
static {
try {
System.loadLibrary("cpp11_std_unordered_set");
} catch (UnsatisfiedLinkError e) {
System.err.println("Native code library failed to load. See the chapter on Dynamic Linking Problems in the SWIG Java documentation for help.\n" + e);
System.exit(1);
}
}
public static void checkThat(boolean mustBeTrue) throws Throwable {
if (!mustBeTrue) {
// Index [2], since this function is one hop away from main, and [1] is the current method.
throw new RuntimeException("Test failed at line number " + Thread.currentThread().getStackTrace()[2].getLineNumber());
}
}
public static void main(String argv[]) throws Throwable
{
java.util.AbstractSet<String> ss = new UnorderedSetString();
checkThat(ss.isEmpty());
checkThat(!ss.contains("key"));
checkThat(!ss.remove("key"));
checkThat(ss.add("key"));
checkThat(!ss.add("key"));
checkThat(ss.contains("key"));
checkThat(ss.remove("key"));
checkThat(ss.isEmpty());
checkThat(ss.size() == 0);
checkThat(ss.add("key1"));
checkThat(ss.add("key2"));
checkThat(ss.add("key3"));
checkThat(ss.size() == 3);
ss.clear();
checkThat(ss.isEmpty());
checkThat(ss.size() == 0);
checkThat(ss.addAll(java.util.Arrays.asList("one", "two", "three")));
checkThat(ss.size() == 3);
checkThat(ss.contains("one"));
checkThat(!ss.contains("four"));
checkThat(ss.containsAll(java.util.Arrays.asList("one", "two", "three")));
checkThat(ss.containsAll(java.util.Arrays.asList("one", "two")));
checkThat(!ss.containsAll(java.util.Arrays.asList("one", "two", "four")));
checkThat(!ss.containsAll(java.util.Arrays.asList("one", "two", "three", "four")));
checkThat(!ss.addAll(java.util.Arrays.asList("one", "two", "three")));
java.util.Set<String> found = new java.util.HashSet<String>();
java.util.Iterator<String> itr = ss.iterator();
while (itr.hasNext()) {
found.add(itr.next());
}
checkThat(ss.containsAll(found));
checkThat(found.containsAll(ss));
java.util.AbstractSet<String> ss2 = new UnorderedSetString(ss);
checkThat(ss2.containsAll(ss));
checkThat(ss.containsAll(ss2));
checkThat(!ss.removeAll(java.util.Arrays.asList("five", "four")));
checkThat(ss.removeAll(found));
checkThat(ss.isEmpty());
checkThat(ss.size() == 0);
}
}