From 7f9fa78b65f460a348623fe06881dfaacec247a0 Mon Sep 17 00:00:00 2001 From: Pierre Labastie Date: Tue, 3 Nov 2015 21:53:34 +0000 Subject: [PATCH] Typos and minor fixes --- BLFS/libs/func_dependencies | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) diff --git a/BLFS/libs/func_dependencies b/BLFS/libs/func_dependencies index ae52296..c9d44aa 100644 --- a/BLFS/libs/func_dependencies +++ b/BLFS/libs/func_dependencies @@ -7,10 +7,10 @@ # This is a set of (recursive) functions for manipulating a dependency # # tree. Everything would be "simple" without circular dependencies. We # # would just have to build the tree using the packages.xml file, and to # -# a function for browsing it. But we need to be able to detect circular # -# dependencies and to possibly change the tree depending on the user # -# decision. This is why we keep with each node a record of the path from # -# the root to the node, which we call *link*. # +# provide a function for browsing it. But we need to be able to detect # +# circular dependencies and to possibly change the tree depending on the # +# user # decision. This is why we keep with each node a record of the path # +# from the root to the node, which we call *link*. # # Layout of the tree: # # Each node is a file .dep, which contains the names of the # # child nodes, one per line, except the first line is the *link*: # @@ -42,13 +42,13 @@ generate_dependency_tree() { # : < with dependencies in $1, a file .dep and its dependencies on error: nothing