refined

Signed-off-by: Xiaoxuan Wang <wangxiaoxuan119@gmail.com>

internal/graph/memory.go

@@ -44,7 +44,7 @@ type Memory struct {
 	//    in the memory.
 	// - Memory.successors:
 	//  1. a node exists in Memory.successors if and only if it exists in the memory.
-	//  2. A node's entry in Memory.successors is always consistent with the actual
+	//  2. a node's entry in Memory.successors is always consistent with the actual
 	//    content of the node, regardless of whether or not each successor exists
 	//    in the memory.
 	nodes        map[digest.Digest]ocispec.Descriptor
@@ -105,7 +105,6 @@ func (m *Memory) Predecessors(_ context.Context, node ocispec.Descriptor) ([]oci
 	m.lock.RLock()
 	defer m.lock.RUnlock()
 
-	// key := descriptor.FromOCI(node)
 	key := node.Digest
 	set, exists := m.predecessors[key]
 	if !exists {
@@ -124,7 +123,6 @@ func (m *Memory) Remove(node ocispec.Descriptor) []ocispec.Descriptor {
 	m.lock.Lock()
 	defer m.lock.Unlock()
 
-	// nodeKey := descriptor.FromOCI(node)
 	nodeKey := node.Digest
 	var danglings []ocispec.Descriptor
 	// remove the node from its successors' predecessor list
@@ -157,7 +155,6 @@ func (m *Memory) index(ctx context.Context, fetcher content.Fetcher, node ocispe
 	defer m.lock.Unlock()
 
 	// index the node
-	// nodeKey := descriptor.FromOCI(node)
 	nodeKey := node.Digest
 	m.nodes[nodeKey] = node
 
@@ -166,7 +163,6 @@ func (m *Memory) index(ctx context.Context, fetcher content.Fetcher, node ocispe
 	successorSet := set.New[digest.Digest]()
 	m.successors[nodeKey] = successorSet
 	for _, successor := range successors {
-		// successorKey := descriptor.FromOCI(successor)
 		successorKey := successor.Digest
 		successorSet.Add(successorKey)
 		predecessorSet, exists := m.predecessors[successorKey]