You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@directory.apache.org by sm...@apache.org on 2018/07/06 00:14:33 UTC

directory-fortress-core git commit: remove some unnecessary comments

Repository: directory-fortress-core
Updated Branches:
  refs/heads/master 5aa751751 -> f7d92656e


remove some unnecessary comments


Project: http://git-wip-us.apache.org/repos/asf/directory-fortress-core/repo
Commit: http://git-wip-us.apache.org/repos/asf/directory-fortress-core/commit/f7d92656
Tree: http://git-wip-us.apache.org/repos/asf/directory-fortress-core/tree/f7d92656
Diff: http://git-wip-us.apache.org/repos/asf/directory-fortress-core/diff/f7d92656

Branch: refs/heads/master
Commit: f7d92656e0f697b73e576b42fb1ed55c85f095dd
Parents: 5aa7517
Author: Shawn McKinney <sm...@apache.org>
Authored: Thu Jul 5 08:15:43 2018 -0500
Committer: Shawn McKinney <sm...@apache.org>
Committed: Thu Jul 5 08:15:43 2018 -0500

----------------------------------------------------------------------
 .../directory/fortress/core/impl/HierUtil.java     | 17 +++--------------
 1 file changed, 3 insertions(+), 14 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/directory-fortress-core/blob/f7d92656/src/main/java/org/apache/directory/fortress/core/impl/HierUtil.java
----------------------------------------------------------------------
diff --git a/src/main/java/org/apache/directory/fortress/core/impl/HierUtil.java b/src/main/java/org/apache/directory/fortress/core/impl/HierUtil.java
index 3381741..8023e43 100755
--- a/src/main/java/org/apache/directory/fortress/core/impl/HierUtil.java
+++ b/src/main/java/org/apache/directory/fortress/core/impl/HierUtil.java
@@ -261,7 +261,6 @@ final class HierUtil
             String v = vertex.get( VERTEX );
             if ( v == null )
             {
-                //log.debug("getDescendants vertex is null");
                 return 0;
             }
             LOG.debug( "hasChildren [{}]", v );
@@ -285,8 +284,7 @@ final class HierUtil
     static Set<String> getAscendants( String childName, SimpleDirectedGraph<String, Relationship> graph )
     {
         Map<String, String> vx = new HashMap<>();
-        // TreeSet will return in sorted order:
-        // create Set with case insensitive comparator:
+        // TreeSet will return in sorted order with case insensitive comparator:
         Set<String> parents = new TreeSet<>( String.CASE_INSENSITIVE_ORDER );
         vx.put( VERTEX, childName.toUpperCase() );
         getAscendants( vx, graph, parents );
@@ -346,8 +344,7 @@ final class HierUtil
     static Set<String> getDescendants( String parentName, SimpleDirectedGraph<String, Relationship> graph )
     {
         Map<String, String> vx = new HashMap<>();
-        // TreeSet will return in sorted order:
-        // create Set with case insensitive comparator:
+        // TreeSet will return in sorted order with case insensitive comparator:
         Set<String> children = new TreeSet<>( String.CASE_INSENSITIVE_ORDER );
         vx.put( VERTEX, parentName.toUpperCase() );
         getDescendants( vx, graph, children );
@@ -411,12 +408,10 @@ final class HierUtil
         String v = vertex.get( VERTEX );
         if ( v == null )
         {
-            // vertex is null
             return null;
         }
         else if ( graph == null )
         {
-            // graph is null
             return null;
         }
         LOG.debug( "getDescendants [{}]", v);
@@ -452,7 +447,6 @@ final class HierUtil
         Set<String> descendants = new HashSet<>();
         if ( graph == null )
         {
-            // graph is null
             return null;
         }
 
@@ -488,8 +482,7 @@ final class HierUtil
         SimpleDirectedGraph<String, Relationship> graph )
     {
         Map<String, String> vx = new HashMap<>();
-        // TreeSet will return in sorted order:
-        // create Set with case insensitive comparator:
+        // TreeSet will return in sorted order with case insensitive comparator:
         Set<String> parents = new TreeSet<>( String.CASE_INSENSITIVE_ORDER );
 
         vx.put( VERTEX, childName.toUpperCase() );
@@ -514,12 +507,10 @@ final class HierUtil
         String v = vertex.get( VERTEX );
         if ( v == null )
         {
-            // vertex is null
             return null;
         }
         else if ( graph == null )
         {
-            // graph is null
             return null;
         }
         LOG.debug( "getAscendants [{}]", v);
@@ -566,7 +557,6 @@ final class HierUtil
         Set<String> parents = new HashSet<>();
         if ( graph == null )
         {
-            // graph is null
             return null;
         }
         LOG.debug( "getParents [{}]", vertex);
@@ -667,7 +657,6 @@ final class HierUtil
             return null;
         }
         graph = toGraph( hier );
-        LOG.debug( "buildGraph success to toGraph" );
         LOG.debug( "buildGraph is success" );
         return graph;
     }