svf-lib 1.0.1874 → 1.0.1876

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

@@ -350,8 +350,8 @@ struct GenericGraphTraits<SVF::CHNode*>
 /// for inverse traversal.
 template <>
 struct GenericGraphTraits<Inverse<SVF::CHNode*>>
-            : public GenericGraphTraits<
-              Inverse<SVF::GenericNode<SVF::CHNode, SVF::CHEdge>*>>
+    : public GenericGraphTraits<
+      Inverse<SVF::GenericNode<SVF::CHNode, SVF::CHEdge>*>>
 {
 };
 

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

@@ -115,7 +115,7 @@ nodes(const GraphType &G)
 }
 template <class GraphType>
 iter_range<typename GenericGraphTraits<Inverse<GraphType>>::nodes_iterator>
-        inverse_nodes(const GraphType &G)
+inverse_nodes(const GraphType &G)
 {
     return make_range(GenericGraphTraits<Inverse<GraphType>>::nodes_begin(G),
                       GenericGraphTraits<Inverse<GraphType>>::nodes_end(G));
@@ -131,7 +131,7 @@ children(const typename GenericGraphTraits<GraphType>::NodeRef &G)
 
 template <class GraphType>
 iter_range<typename GenericGraphTraits<Inverse<GraphType>>::ChildIteratorType>
-        inverse_children(const typename GenericGraphTraits<GraphType>::NodeRef &G)
+inverse_children(const typename GenericGraphTraits<GraphType>::NodeRef &G)
 {
     return make_range(GenericGraphTraits<Inverse<GraphType>>::child_begin(G),
                       GenericGraphTraits<Inverse<GraphType>>::child_end(G));

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

@@ -382,7 +382,7 @@ inline typename cast_retty<X, Y *>::ret_type cast(Y *Val)
 
 template <class X, class Y>
 inline typename cast_retty<X, std::unique_ptr<Y>>::ret_type
-        cast(std::unique_ptr<Y> &&Val)
+cast(std::unique_ptr<Y> &&Val)
 {
     assert(SVFUtil::isa<X>(Val.get()) && "cast<Ty>() argument of incompatible type!");
     using ret_type = typename cast_retty<X, std::unique_ptr<Y>>::ret_type;

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

@@ -192,8 +192,8 @@ public:
 
         // From all the candidates, returns the best mapping for pointsToSets (points-to set -> # occurrences).
         static inline std::pair<hclust_fast_methods, std::vector<NodeID>> determineBestMapping(
-                    const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
-                    Map<PointsTo, unsigned> pointsToSets, const std::string &evalSubtitle, double &evalTime);
+            const std::vector<std::pair<hclust_fast_methods, std::vector<NodeID>>> &candidates,
+            Map<PointsTo, unsigned> pointsToSets, const std::string &evalSubtitle, double &evalTime);
 
     };
 };

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

@@ -352,7 +352,7 @@ struct pointee_iter
 template <typename RangeT, typename WrappedIteratorT =
           decltype(std::begin(std::declval<RangeT>()))>
 iter_range<pointee_iter<WrappedIteratorT>>
-                                        make_pointee_range(RangeT &&Range)
+make_pointee_range(RangeT &&Range)
 {
     using PointeeIteratorT = pointee_iter<WrappedIteratorT>;
     return make_range(PointeeIteratorT(std::begin(std::forward<RangeT>(Range))),
@@ -388,7 +388,7 @@ public:
 template <typename RangeT, typename WrappedIteratorT =
           decltype(std::begin(std::declval<RangeT>()))>
 iter_range<pointer_iterator<WrappedIteratorT>>
-        make_pointer_range(RangeT &&Range)
+make_pointer_range(RangeT &&Range)
 {
     using PointerIteratorT = pointer_iterator<WrappedIteratorT>;
     return make_range(PointerIteratorT(std::begin(std::forward<RangeT>(Range))),

package/package.json

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