1 files changed, 167 insertions, 0 deletions
diff --git a/STL/map.h b/STL/map.h
new file mode 100644
index 00000000000..2cf7e543269
--- /dev/null
+++ b/STL/map.h
@@ -0,0 +1,167 @@
+/*
+ *
+ * Copyright (c) 1994
+ * Hewlett-Packard Company
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Hewlett-Packard Company and Microsoft
+ * Corporation make no representations about the suitability of this
+ * software for any purpose.  It is provided "as is" without express or
+ * implied warranty.
+ *
+ */
+
+#ifndef MAP_H
+#define MAP_H
+
+#ifndef Allocator
+#define Allocator allocator
+#include <defalloc.h>
+#endif
+
+#include <tree.h>
+
+
+/*
+ *Added by d:\\convert.pl --begin--
+ */
+namespace std {
+/*
+ *Added by d:\\convert.pl --end--
+ */
+
+template <class Key, class T, class Compare>
+class map {
+public:
+
+// typedefs:
+
+    typedef Key key_type;
+    typedef pair<const Key, T> value_type;
+    typedef Compare key_compare;
+    
+    class value_compare
+        : public binary_function<value_type, value_type, bool> {
+    friend class map<Key, T, Compare>;
+    protected :
+        Compare comp;
+        value_compare(Compare c) : comp(c) {}
+    public:
+        bool operator()(const value_type& x, const value_type& y) const {
+            return comp(x.first, y.first);
+        }
+    };
+
+private:
+    typedef rb_tree<key_type, value_type, 
+                    select1st<value_type, key_type>, key_compare> rep_type;
+    rep_type t;  // red-black tree representing map
+public:
+    typedef rep_type::pointer pointer;
+    typedef rep_type::reference reference;
+    typedef rep_type::const_reference const_reference;
+    typedef rep_type::iterator iterator;
+    typedef rep_type::const_iterator const_iterator;
+    typedef rep_type::reverse_iterator reverse_iterator;
+    typedef rep_type::const_reverse_iterator const_reverse_iterator;
+    typedef rep_type::size_type size_type;
+    typedef rep_type::difference_type difference_type;
+
+// allocation/deallocation
+
+    map(const Compare& comp = Compare()) : t(comp, false) {}
+    map(const value_type* first, const value_type* last, 
+        const Compare& comp = Compare()) : t(first, last, comp, false) {}
+    map(const map<Key, T, Compare>& x) : t(x.t, false) {}
+    map<Key, T, Compare>& operator=(const map<Key, T, Compare>& x) {
+        t = x.t;
+        return *this; 
+    }
+
+// accessors:
+
+    key_compare key_comp() const { return t.key_comp(); }
+    value_compare value_comp() const { return value_compare(t.key_comp()); }
+    iterator begin() { return t.begin(); }
+    const_iterator begin() const { return t.begin(); }
+    iterator end() { return t.end(); }
+    const_iterator end() const { return t.end(); }
+    reverse_iterator rbegin() { return t.rbegin(); }
+    const_reverse_iterator rbegin() const { return t.rbegin(); }
+    reverse_iterator rend() { return t.rend(); }
+    const_reverse_iterator rend() const { return t.rend(); }
+    bool empty() const { return t.empty(); }
+    size_type size() const { return t.size(); }
+    size_type max_size() const { return t.max_size(); }
+    Allocator<T>::reference operator[](const key_type& k) {
+        return (*((insert(value_type(k, T()))).first)).second;
+    }
+    void swap(map<Key, T, Compare>& x) { t.swap(x.t); }
+
+// insert/erase
+
+    typedef pair<iterator, bool> pair_iterator_bool; 
+    // typedef done to get around compiler bug
+    pair_iterator_bool insert(const value_type& x) { return t.insert(x); }
+    iterator insert(iterator position, const value_type& x) {
+        return t.insert(position, x);
+    }
+    void insert(const value_type* first, const value_type* last) {
+        t.insert(first, last);
+    }
+    void erase(iterator position) { t.erase(position); }
+    size_type erase(const key_type& x) { return t.erase(x); }
+    void erase(iterator first, iterator last) { t.erase(first, last); }
+
+// map operations:
+
+    iterator find(const key_type& x) { return t.find(x); }
+    const_iterator find(const key_type& x) const { return t.find(x); }
+    size_type count(const key_type& x) const { return t.count(x); }
+    iterator lower_bound(const key_type& x) {return t.lower_bound(x); }
+    const_iterator lower_bound(const key_type& x) const {
+        return t.lower_bound(x); 
+    }
+    iterator upper_bound(const key_type& x) {return t.upper_bound(x); }
+    const_iterator upper_bound(const key_type& x) const {
+        return t.upper_bound(x); 
+    }
+    typedef pair<iterator, iterator> pair_iterator_iterator; 
+    // typedef done to get around compiler bug
+    pair_iterator_iterator equal_range(const key_type& x) {
+        return t.equal_range(x);
+    }
+    typedef pair<const_iterator, const_iterator> pair_citerator_citerator; 
+    // typedef done to get around compiler bug
+    pair_citerator_citerator equal_range(const key_type& x) const {
+        return t.equal_range(x);
+    }
+};
+
+template <class Key, class T, class Compare>
+inline bool operator==(const map<Key, T, Compare>& x, 
+                       const map<Key, T, Compare>& y) {
+    return x.size() == y.size() && equal(x.begin(), x.end(), y.begin());
+}
+
+template <class Key, class T, class Compare>
+inline bool operator<(const map<Key, T, Compare>& x, 
+                      const map<Key, T, Compare>& y) {
+    return lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());
+}
+
+#undef Allocator
+
+
+/*
+ *Added by d:\\convert.pl --begin--
+ */
+}
+/*
+ *Added by d:\\convert.pl --end--
+ */
+
+#endif