svf-lib 1.0.2266 → 1.0.2267

package/SVF-osx/Release-build/include/CFL/CFGrammar.h

@@ -147,17 +147,17 @@ public:
     template<typename Key, typename Value, typename Hash = SymbolHash,
              typename KeyEqual = std::equal_to<Key>,
              typename Allocator = std::allocator<std::pair<const Key, Value>>>
-                 using SymbolMap = std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>;
+    using SymbolMap = std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>;
 
-             template <typename Key, typename Hash = SymbolVectorHash, typename KeyEqual = std::equal_to<Key>,
-                       typename Allocator = std::allocator<Key>>
-             using SymbolSet = std::unordered_set<Key, Hash, KeyEqual, Allocator>;
+    template <typename Key, typename Hash = SymbolVectorHash, typename KeyEqual = std::equal_to<Key>,
+              typename Allocator = std::allocator<Key>>
+    using SymbolSet = std::unordered_set<Key, Hash, KeyEqual, Allocator>;
 
-             typedef std::vector<Symbol> Production;
-             typedef SymbolSet<Production> Productions;
+    typedef std::vector<Symbol> Production;
+    typedef SymbolSet<Production> Productions;
 
 
-             inline Map<std::string, Kind>& getNonterminals()
+    inline Map<std::string, Kind>& getNonterminals()
     {
         return this->nonterminals;
     }

package/SVF-osx/Release-build/include/CFL/CFLGraphBuilder.h

@@ -117,8 +117,7 @@ public:
 };
 
 /// AliasCFLGraphBuilder: a CFLGraphBuilder specialized for handling aliasing
-class AliasCFLGraphBuilder :
-    public CFLGraphBuilder
+class AliasCFLGraphBuilder : public CFLGraphBuilder
 {
 public:
     /// Builds a bidirectional CFL graph by copying nodes and edges from a const graph that inherits from GenericGraph
@@ -140,8 +139,7 @@ private:
 };
 
 /// VFCFLGraphBuilder: a CFLGraphBuilder specialized for handling value-flow
-class VFCFLGraphBuilder :
-    public CFLGraphBuilder
+class VFCFLGraphBuilder : public CFLGraphBuilder
 {
 public:
     /// Builds a bidirectional CFL graph by copying nodes and edges from a const graph that inherits from SVFG

package/SVF-osx/Release-build/include/Graphs/WTO.h

@@ -494,7 +494,7 @@ public:
 
     /// Copy assignment operator
     WTOComponentVisitor& operator=(const WTOComponentVisitor&) noexcept =
-    default;
+        default;
 
     /// Move assignment operator
     WTOComponentVisitor& operator=(WTOComponentVisitor&&) noexcept = default;
@@ -702,7 +702,7 @@ protected:
             WTOCycleDepthPtr previous_cycleDepth = _wtoCycleDepth;
             _nodeToWTOCycleDepth.insert(std::make_pair(head, _wtoCycleDepth));
             _wtoCycleDepth =
-            std::make_shared<GraphTWTOCycleDepth>(*_wtoCycleDepth);
+                std::make_shared<GraphTWTOCycleDepth>(*_wtoCycleDepth);
             _wtoCycleDepth->add(head);
             for (auto it = cycle.begin(), et = cycle.end(); it != et; ++it)
             {

package/SVF-osx/Release-build/include/SVF-LLVM/DCHG.h

@@ -203,8 +203,7 @@ private:
 };
 
 /// Dwarf based CHG.
-class DCHGraph :
-    public CommonCHGraph, public GenericGraph<DCHNode, DCHEdge>
+class DCHGraph : public CommonCHGraph, public GenericGraph<DCHNode, DCHEdge>
 {
 public:
     /// Returns the DIType beneath the qualifiers. Does not strip away "DW_TAG_members".

package/SVF-osx/Release-build/include/SVFIR/SVFStatements.h

@@ -1244,8 +1244,7 @@ public:
 /*!
  * Thread Fork
  */
-class TDForkPE:
-    public CallPE
+class TDForkPE: public CallPE
 {
     friend class SVFIRWriter;
     friend class SVFIRReader;
@@ -1286,8 +1285,7 @@ public:
 /*!
  * Thread Join
  */
-class TDJoinPE:
-    public RetPE
+class TDJoinPE: public RetPE
 {
     friend class SVFIRWriter;
     friend class SVFIRReader;

package/SVF-osx/Release-build/include/Util/Casting.h

@@ -217,8 +217,8 @@ struct isa_impl_wrap
     static bool doit(const From &Val)
     {
         return isa_impl_wrap<To, SimpleFrom,
-        typename simplify_type<SimpleFrom>::SimpleType>::doit(
-            simplify_type<const From>::getSimplifiedValue(Val));
+               typename simplify_type<SimpleFrom>::SimpleType>::doit(
+                   simplify_type<const From>::getSimplifiedValue(Val));
     }
 };
 
@@ -285,11 +285,11 @@ template<class To, class From> struct cast_retty_impl<To, const From*const>
 template <class To, class From>
 struct cast_retty_impl<To, std::unique_ptr<From>>
 {
-    private:
+private:
     using PointerType = typename cast_retty_impl<To, From *>::ret_type;
     using ResultType = typename std::remove_pointer<PointerType>::type;
 
-    public:
+public:
     using ret_type = std::unique_ptr<ResultType>;
 };
 
@@ -325,8 +325,8 @@ template<class To, class From, class SimpleFrom> struct cast_convert_val
     static typename cast_retty<To, From>::ret_type doit(From &Val)
     {
         return cast_convert_val<To, SimpleFrom,
-        typename simplify_type<SimpleFrom>::SimpleType>::doit(
-            simplify_type<From>::getSimplifiedValue(Val));
+               typename simplify_type<SimpleFrom>::SimpleType>::doit(
+                   simplify_type<From>::getSimplifiedValue(Val));
     }
 };
 

package/SVF-osx/Release-build/include/Util/GeneralType.h

@@ -98,30 +98,30 @@ using Set = std::unordered_set<Key, Hash, KeyEqual, Allocator>;
 template <typename Key, typename Value, typename Hash = Hash<Key>,
           typename KeyEqual = std::equal_to<Key>,
           typename Allocator = std::allocator<std::pair<const Key, Value>>>
-              using Map = std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>;
-
-          template <typename Key, typename Compare = std::less<Key>,
-                    typename Allocator = std::allocator<Key>>
-          using OrderedSet = std::set<Key, Compare, Allocator>;
-
-          template <typename Key, typename Value, typename Compare = std::less<Key>,
-                    typename Allocator = std::allocator<std::pair<const Key, Value>>>
-                        using OrderedMap = std::map<Key, Value, Compare, Allocator>;
-
-                    typedef std::pair<NodeID, NodeID> NodePair;
-                    typedef OrderedSet<NodeID> OrderedNodeSet;
-                    typedef Set<NodeID> NodeSet;
-                    typedef Set<NodePair> NodePairSet;
-                    typedef Map<NodePair, NodeID> NodePairMap;
-                    typedef std::vector<NodeID> NodeVector;
-                    typedef std::vector<EdgeID> EdgeVector;
-                    typedef std::stack<NodeID> NodeStack;
-                    typedef std::list<NodeID> NodeList;
-                    typedef std::deque<NodeID> NodeDeque;
-                    typedef NodeSet EdgeSet;
-                    typedef std::vector<u32_t> CallStrCxt;
-                    typedef unsigned Version;
-                    typedef Set<Version> VersionSet;
-                    typedef std::pair<NodeID, Version> VersionedVar;
-                    typedef Set<VersionedVar> VersionedVarSet;
+using Map = std::unordered_map<Key, Value, Hash, KeyEqual, Allocator>;
+
+template <typename Key, typename Compare = std::less<Key>,
+          typename Allocator = std::allocator<Key>>
+using OrderedSet = std::set<Key, Compare, Allocator>;
+
+template <typename Key, typename Value, typename Compare = std::less<Key>,
+          typename Allocator = std::allocator<std::pair<const Key, Value>>>
+using OrderedMap = std::map<Key, Value, Compare, Allocator>;
+
+typedef std::pair<NodeID, NodeID> NodePair;
+typedef OrderedSet<NodeID> OrderedNodeSet;
+typedef Set<NodeID> NodeSet;
+typedef Set<NodePair> NodePairSet;
+typedef Map<NodePair, NodeID> NodePairMap;
+typedef std::vector<NodeID> NodeVector;
+typedef std::vector<EdgeID> EdgeVector;
+typedef std::stack<NodeID> NodeStack;
+typedef std::list<NodeID> NodeList;
+typedef std::deque<NodeID> NodeDeque;
+typedef NodeSet EdgeSet;
+typedef std::vector<u32_t> CallStrCxt;
+typedef unsigned Version;
+typedef Set<Version> VersionSet;
+typedef std::pair<NodeID, Version> VersionedVar;
+typedef Set<VersionedVar> VersionedVarSet;
 }

package/SVF-osx/Release-build/include/Util/SVFUtil.h

@@ -436,7 +436,7 @@ template <typename T, typename = void> struct is_iterable : std::false_type {};
 template <typename T>
 struct is_iterable<T, void_t<decltype(std::begin(std::declval<T&>()) !=
                                       std::end(std::declval<T&>()))>>
-    : std::true_type {};
+: std::true_type {};
 template <typename T> constexpr bool is_iterable_v = is_iterable<T>::value;
 ///@}
 

package/package.json

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