diff --git a/src/merkleblock.cpp b/src/merkleblock.cpp
--- a/src/merkleblock.cpp
+++ b/src/merkleblock.cpp
@@ -67,7 +67,7 @@
     }
 
     // Combine subhashes.
-    return Hash(BEGIN(left), END(left), BEGIN(right), END(right));
+    return Hash(left.begin(), left.end(), right.begin(), right.end());
 }
 
 void CPartialMerkleTree::TraverseAndBuild(int height, size_t pos,
@@ -140,7 +140,7 @@
     }
 
     // and combine them before returning.
-    return Hash(BEGIN(left), END(left), BEGIN(right), END(right));
+    return Hash(left.begin(), left.end(), right.begin(), right.end());
 }
 
 CPartialMerkleTree::CPartialMerkleTree(const std::vector<uint256> &vTxid,
diff --git a/src/test/merkle_tests.cpp b/src/test/merkle_tests.cpp
--- a/src/test/merkle_tests.cpp
+++ b/src/test/merkle_tests.cpp
@@ -20,9 +20,9 @@
     for (std::vector<uint256>::const_iterator it = vMerkleBranch.begin();
          it != vMerkleBranch.end(); ++it) {
         if (nIndex & 1) {
-            hash = Hash(BEGIN(*it), END(*it), BEGIN(hash), END(hash));
+            hash = Hash(it->begin(), it->end(), hash.begin(), hash.end());
         } else {
-            hash = Hash(BEGIN(hash), END(hash), BEGIN(*it), END(*it));
+            hash = Hash(hash.begin(), hash.end(), it->begin(), it->end());
         }
         nIndex >>= 1;
     }