svf-lib 1.0.1247 → 1.0.1249

package/SVF-linux/include/Util/WorkList.h

@@ -58,7 +58,7 @@ class List
     class ListNode
     {
     public:
-        ListNode(const Data& d)
+        ListNode(const Data &d)
         {
             data = d;
             next = nullptr;
@@ -67,7 +67,7 @@ class List
         ~ListNode() {}
 
         Data data;
-        ListNode* next;
+        ListNode *next;
     };
 
     typedef Set<Data> DataSet;
@@ -87,16 +87,16 @@ public:
         return (head == nullptr);
     }
 
-    inline bool find(const Data& data) const
+    inline bool find(const Data &data) const
     {
-        return (nodeSet.find(data) == nodeSet.end() ? false : true);
+        return nodeSet.find(data) != nodeSet.end();
     }
 
-    void push(const Data& data)
+    void push(const Data &data)
     {
         if (nodeSet.find(data) == nodeSet.end())
         {
-            Node* new_node = new Node(data);
+            Node *new_node = new Node(data);
             if (head == nullptr)
                 head = new_node;// the list is empty
             else
@@ -109,12 +109,12 @@ public:
     {
         assert(head != nullptr && "list is empty");
         /// get node from list head
-        Node* head_node = head;
+        Node *head_node = head;
 
         /// change list head to the next node
         head = head->next;
         if (head == nullptr)
-            tail = nullptr;	/// the last node is popped.
+            tail = nullptr;    /// the last node is popped.
 
         Data data = head_node->data;
         nodeSet.erase(data);
@@ -124,8 +124,8 @@ public:
 
 private:
     DataSet nodeSet;
-    Node* head;
-    Node* tail;
+    Node *head;
+    Node *tail;
 };
 
 /**
@@ -136,6 +136,7 @@ private:
 template<class Data>
 class FIFOWorkList
 {
+    typedef Set<Data> DataSet;
     typedef std::deque<Data> DataDeque;
 public:
     FIFOWorkList() {}
@@ -147,28 +148,30 @@ public:
         return data_list.empty();
     }
 
-    inline bool find(const Data& data) const
+    inline u32_t size() const
     {
-        return std::find(data_list.begin(), data_list.end(), data) != data_list.end();
+        assert(data_list.size() == data_set.size() && "list and set must be the same size!");
+        return data_list.size();
     }
 
-    /**
-     * Push a data into the work list.
-     */
-    inline bool push(const Data& data)
+    inline bool find(const Data &data) const
     {
-        data_list.push_back(data);
-        return true;
+        return data_set.find(data) != data_set.end();
     }
 
     /**
-     * Pop a data from the END of work list.
+     * Push a data into the work list.
      */
-    inline Data pop()
+    inline bool push(const Data &data)
     {
-        Data data = front();
-        removeFront();
-        return data;
+        if (!find(data))
+        {
+            data_list.push_back(data);
+            data_set.insert(data);
+            return true;
+        }
+        else
+            return false;
     }
 
     /**
@@ -177,16 +180,29 @@ public:
     inline void removeFront()
     {
         assert(!empty() && "work list is empty");
+        data_set.erase(front());
         data_list.pop_front();
     }
 
     /**
      * Get reference of top data from the END of work list.
      */
-    inline Data& front()
+    inline Data &front()
+    {
+        assert(!empty() && "work list is empty");
+        Data &data = data_list.front();
+        return data;
+    }
+
+    /**
+     * Pop a data from the END of work list.
+     */
+    inline Data pop()
     {
         assert(!empty() && "work list is empty");
-        Data& data = data_list.front();
+        Data data = data_list.front();
+        data_list.pop_front();
+        data_set.erase(data);
         return data;
     }
 
@@ -196,10 +212,12 @@ public:
     inline void clear()
     {
         data_list.clear();
+        data_set.clear();
     }
 
 private:
-    DataDeque data_list;	///< work list using std::vector.
+    DataSet data_set;    ///< store all data in the work list.
+    DataDeque data_list;    ///< work list using std::vector.
 };
 
 /**
@@ -210,6 +228,7 @@ private:
 template<class Data>
 class FILOWorkList
 {
+    typedef Set<Data> DataSet;
     typedef std::vector<Data> DataVector;
 public:
     FILOWorkList() {}
@@ -221,18 +240,30 @@ public:
         return data_list.empty();
     }
 
-    inline bool find(const Data& data) const
+    inline u32_t size() const
     {
-        return std::find(data_list.begin(), data_list.end(), data) != data_list.end();
+        assert(data_list.size() == data_set.size() && "list and set must be the same size!");
+        return data_list.size();
+    }
+
+    inline bool find(const Data &data) const
+    {
+        return data_set.find(data) != data_set.end();;
     }
 
     /**
      * Push a data into the work list.
      */
-    inline bool push(const Data& data)
+    inline bool push(const Data &data)
     {
-        data_list.push_back(data);
-        return true;
+        if (!find(data))
+        {
+            data_list.push_back(data);
+            data_set.insert(data);
+            return true;
+        }
+        else
+            return false;
     }
 
     /**
@@ -240,8 +271,10 @@ public:
      */
     inline Data pop()
     {
-        Data data = back();
-        removeBack();
+        assert(!empty() && "work list is empty");
+        Data data = data_list.back();
+        data_list.pop_back();
+        data_set.erase(data);
         return data;
     }
 
@@ -251,16 +284,17 @@ public:
     inline void removeBack()
     {
         assert(!empty() && "work list is empty");
+        data_set.erase(back());
         data_list.pop_back();
     }
 
     /**
      * Get reference of top data from the END of work list.
      */
-    inline Data& back()
+    inline Data &back()
     {
         assert(!empty() && "work list is empty");
-        Data& data = data_list.back();
+        Data &data = data_list.back();
         return data;
     }
 
@@ -270,10 +304,12 @@ public:
     inline void clear()
     {
         data_list.clear();
+        data_set.clear();
     }
 
 private:
-    DataVector data_list;	///< work list using std::vector.
+    DataSet data_set;    ///< store all data in the work list.
+    DataVector data_list;    ///< work list using std::vector.
 };
 
 } // End namespace SVF

package/SVF-osx/include/Util/WorkList.h

@@ -58,7 +58,7 @@ class List
     class ListNode
     {
     public:
-        ListNode(const Data& d)
+        ListNode(const Data &d)
         {
             data = d;
             next = nullptr;
@@ -67,7 +67,7 @@ class List
         ~ListNode() {}
 
         Data data;
-        ListNode* next;
+        ListNode *next;
     };
 
     typedef Set<Data> DataSet;
@@ -87,16 +87,16 @@ public:
         return (head == nullptr);
     }
 
-    inline bool find(const Data& data) const
+    inline bool find(const Data &data) const
     {
-        return (nodeSet.find(data) == nodeSet.end() ? false : true);
+        return nodeSet.find(data) != nodeSet.end();
     }
 
-    void push(const Data& data)
+    void push(const Data &data)
     {
         if (nodeSet.find(data) == nodeSet.end())
         {
-            Node* new_node = new Node(data);
+            Node *new_node = new Node(data);
             if (head == nullptr)
                 head = new_node;// the list is empty
             else
@@ -109,12 +109,12 @@ public:
     {
         assert(head != nullptr && "list is empty");
         /// get node from list head
-        Node* head_node = head;
+        Node *head_node = head;
 
         /// change list head to the next node
         head = head->next;
         if (head == nullptr)
-            tail = nullptr;	/// the last node is popped.
+            tail = nullptr;    /// the last node is popped.
 
         Data data = head_node->data;
         nodeSet.erase(data);
@@ -124,8 +124,8 @@ public:
 
 private:
     DataSet nodeSet;
-    Node* head;
-    Node* tail;
+    Node *head;
+    Node *tail;
 };
 
 /**
@@ -136,6 +136,7 @@ private:
 template<class Data>
 class FIFOWorkList
 {
+    typedef Set<Data> DataSet;
     typedef std::deque<Data> DataDeque;
 public:
     FIFOWorkList() {}
@@ -147,28 +148,30 @@ public:
         return data_list.empty();
     }
 
-    inline bool find(const Data& data) const
+    inline u32_t size() const
     {
-        return std::find(data_list.begin(), data_list.end(), data) != data_list.end();
+        assert(data_list.size() == data_set.size() && "list and set must be the same size!");
+        return data_list.size();
     }
 
-    /**
-     * Push a data into the work list.
-     */
-    inline bool push(const Data& data)
+    inline bool find(const Data &data) const
     {
-        data_list.push_back(data);
-        return true;
+        return data_set.find(data) != data_set.end();
     }
 
     /**
-     * Pop a data from the END of work list.
+     * Push a data into the work list.
      */
-    inline Data pop()
+    inline bool push(const Data &data)
     {
-        Data data = front();
-        removeFront();
-        return data;
+        if (!find(data))
+        {
+            data_list.push_back(data);
+            data_set.insert(data);
+            return true;
+        }
+        else
+            return false;
     }
 
     /**
@@ -177,16 +180,29 @@ public:
     inline void removeFront()
     {
         assert(!empty() && "work list is empty");
+        data_set.erase(front());
         data_list.pop_front();
     }
 
     /**
      * Get reference of top data from the END of work list.
      */
-    inline Data& front()
+    inline Data &front()
+    {
+        assert(!empty() && "work list is empty");
+        Data &data = data_list.front();
+        return data;
+    }
+
+    /**
+     * Pop a data from the END of work list.
+     */
+    inline Data pop()
     {
         assert(!empty() && "work list is empty");
-        Data& data = data_list.front();
+        Data data = data_list.front();
+        data_list.pop_front();
+        data_set.erase(data);
         return data;
     }
 
@@ -196,10 +212,12 @@ public:
     inline void clear()
     {
         data_list.clear();
+        data_set.clear();
     }
 
 private:
-    DataDeque data_list;	///< work list using std::vector.
+    DataSet data_set;    ///< store all data in the work list.
+    DataDeque data_list;    ///< work list using std::vector.
 };
 
 /**
@@ -210,6 +228,7 @@ private:
 template<class Data>
 class FILOWorkList
 {
+    typedef Set<Data> DataSet;
     typedef std::vector<Data> DataVector;
 public:
     FILOWorkList() {}
@@ -221,18 +240,30 @@ public:
         return data_list.empty();
     }
 
-    inline bool find(const Data& data) const
+    inline u32_t size() const
     {
-        return std::find(data_list.begin(), data_list.end(), data) != data_list.end();
+        assert(data_list.size() == data_set.size() && "list and set must be the same size!");
+        return data_list.size();
+    }
+
+    inline bool find(const Data &data) const
+    {
+        return data_set.find(data) != data_set.end();;
     }
 
     /**
      * Push a data into the work list.
      */
-    inline bool push(const Data& data)
+    inline bool push(const Data &data)
     {
-        data_list.push_back(data);
-        return true;
+        if (!find(data))
+        {
+            data_list.push_back(data);
+            data_set.insert(data);
+            return true;
+        }
+        else
+            return false;
     }
 
     /**
@@ -240,8 +271,10 @@ public:
      */
     inline Data pop()
     {
-        Data data = back();
-        removeBack();
+        assert(!empty() && "work list is empty");
+        Data data = data_list.back();
+        data_list.pop_back();
+        data_set.erase(data);
         return data;
     }
 
@@ -251,16 +284,17 @@ public:
     inline void removeBack()
     {
         assert(!empty() && "work list is empty");
+        data_set.erase(back());
         data_list.pop_back();
     }
 
     /**
      * Get reference of top data from the END of work list.
      */
-    inline Data& back()
+    inline Data &back()
     {
         assert(!empty() && "work list is empty");
-        Data& data = data_list.back();
+        Data &data = data_list.back();
         return data;
     }
 
@@ -270,10 +304,12 @@ public:
     inline void clear()
     {
         data_list.clear();
+        data_set.clear();
     }
 
 private:
-    DataVector data_list;	///< work list using std::vector.
+    DataSet data_set;    ///< store all data in the work list.
+    DataVector data_list;    ///< work list using std::vector.
 };
 
 } // End namespace SVF

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-lib",
-  "version": "1.0.1247",
+  "version": "1.0.1249",
   "description": "SVF's npm support",
   "main": "index.js",
   "scripts": {