binary-trie fixed test

Author: gandalfr-KY

cpp/binary-trie.hpp

@@ -122,7 +122,7 @@ template <unsigned int d> class BinaryTrie {
      * @note nがtrie木のサイズ以上な場合、assert
      */
     unsigned long long nth_element(unsigned int n) const {
-        assert(n < (int)size());
+        assert((int)n < size());
         unsigned long long ret = 0;
         NodePtr cur_ptr = root_ptr;
         while (!cur_ptr->is_leaf()) {

test/aoj-itp1-1-a.binary-trie.test.cpp

@@ -41,7 +41,7 @@ int main(void) {
             BT.insert(x);   
             break;
         case 1:
-            A.erase(std::remove_if(A.begin(), A.end(), [&](int a) { return a == x; }), A.end());
+            A.erase(std::remove_if(A.begin(), A.end(), [&](unsigned long long a) { return a == x; }), A.end());
             BT.erase(x);
             break;
         case 2:
@@ -65,10 +65,10 @@ int main(void) {
             assert(A[x] == BT.nth_element(x));
             break;
         case 6:
-            assert(std::count(A.begin(), A.end(), x) == BT.count(x));
+            assert((int)std::count(A.begin(), A.end(), x) == BT.count(x));
             break;
         case 7:
-            assert(A.size() == BT.size());
+            assert((int)A.size() == BT.size());
         default:
             break;
         }