Rename fletch -> dartino

src/vm/priority_heap_test.cc

 // Copyright (c) 2015, the Dartino project authors. Please see the AUTHORS file
 // for details. all rights reserved. use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE.md file.
 
 #include "src/shared/assert.h"
 #include "src/shared/flags.h"
 #include "src/shared/test_case.h"
 
 #include "src/vm/priority_heap.h"
 
-namespace fletch {
+namespace dartino {
 
 TEST_CASE(PRIORITY_HEAP_WITH_INDEX__INCREASING) {
   const word kSize = PriorityHeapWithValueIndex<word, word>::kMinimumSize;
 
   PriorityHeapWithValueIndex<word, word> heap;
   for (word i = 0; i < kSize; i++) {
     heap.Insert(i, 10 + i);
   }
   ASSERT(heap.backing_size() == kSize);
   for (word i = 0; i < kSize; i++) {
@@ skipping 138 matching lines @@
       EXPECT_EQ(expected_priority, heap.Minimum().priority);
       EXPECT_EQ(10 + i, heap.Minimum().value);
       EXPECT(heap.ContainsValue(10 + i));
       heap.RemoveMinimum();
       EXPECT(!heap.ContainsValue(10 + i));
     }
   }
   EXPECT(heap.IsEmpty());
 }
 
-}  // namespace fletch.
+}  // namespace dartino.