Implement simple effect typing for variables

src/splay-tree.h

 // Copyright 2010 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 21 matching lines @@
 
 namespace v8 {
 namespace internal {
 
 
 // A splay tree.  The config type parameter encapsulates the different
 // configurations of a concrete splay tree:
 //
 //   typedef Key: the key type
 //   typedef Value: the value type
-//   static const kNoKey: the dummy key used when no key is set
-//   static const kNoValue: the dummy value used to initialize nodes
-//   int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
+//   static const Key kNoKey: the dummy key used when no key is set
+//   static Value kNoValue(): the dummy value used to initialize nodes
+//   static int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
 //
 // The tree is also parameterized by an allocation policy
 // (Allocator). The policy is used for allocating lists in the C free
 // store or the zone; see zone.h.
 
 // Forward defined as
 // template <typename Config, class Allocator = FreeStoreAllocationPolicy>
 //     class SplayTree;
 template <typename Config, class AllocationPolicy>
 class SplayTree {
@@ skipping 12 matching lines @@
     return allocator.New(static_cast<int>(size));
   }
   INLINE(void operator delete(void* p)) {
     AllocationPolicy::Delete(p);
   }
   // Please the MSVC compiler.  We should never have to execute this.
   INLINE(void operator delete(void* p, AllocationPolicy policy)) {
     UNREACHABLE();
   }
 
+  AllocationPolicy allocator() { return allocator_; }
+
+  // Checks if there is a mapping for the key.
+  bool Contains(const Key& key);
+
   // Inserts the given key in this tree with the given value.  Returns
   // true if a node was inserted, otherwise false.  If found the locator
   // is enabled and provides access to the mapping for the key.
   bool Insert(const Key& key, Locator* locator);
 
   // Looks up the key in this tree and returns true if it was found,
   // otherwise false.  If the node is found the locator is enabled and
   // provides access to the mapping for the key.
   bool Find(const Key& key, Locator* locator);
 
@@ skipping 10 matching lines @@
 
   // Find the mapping with the least key in this tree.
   bool FindLeast(Locator* locator);
 
   // Move the node from one key to another.
   bool Move(const Key& old_key, const Key& new_key);
 
   // Remove the node with the given key from the tree.
   bool Remove(const Key& key);
 
+  // Remove all keys from the tree.
+  void Clear() { ResetRoot(); }
+
   bool is_empty() { return root_ == NULL; }
 
   // Perform the splay operation for the given key. Moves the node with
   // the given key to the top of the tree.  If no node has the given
   // key, the last node on the search path is moved to the top of the
   // tree.
   void Splay(const Key& key);
 
   class Node {
    public:
@@ skipping 92 matching lines @@
   Node* root_;
   AllocationPolicy allocator_;
 
   DISALLOW_COPY_AND_ASSIGN(SplayTree);
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPLAY_TREE_H_