fix broken references

Author: amejiarosario

book/book.adoc

@@ -30,6 +30,7 @@ endif::[]
 :datadir: {docdir}/data
 :source-highlighter: pygments
 :pygments-style: xcode
+// :chapter-label:
 
 
 ifndef::ebook-format[:leveloffset: 1]
@@ -48,6 +49,9 @@ include::chapters/preface.adoc[]
 
 // include::chapters/introduction.adoc[]
 
+// TODO: (optional) include numbers but need to fix the part/chapter labels
+// :sectnums:
+
 include::chapters/chapter1.adoc[]
 
 include::chapters/chapter2.adoc[]
@@ -56,6 +60,8 @@ include::chapters/chapter3.adoc[]
 
 include::chapters/chapter4.adoc[]
 
+// :sectnums!:
+
 include::chapters/appendix.adoc[]
 
 // include::chapters/epigraph.adoc[]

book/chapters/algorithms-analysis.adoc

@@ -72,7 +72,7 @@ Find bottlenecks of existing software and have an "algorithmic toolbox" to switc
 The first step to improve your code performance is to measure it. As somebody said:
 
 [quote, H. J. Harrington]
-Measurement is the first step that leads to control and eventually to improvement. If you can’t measure something, you can’t understand it. If you can’t understand it, you can’t control it. If you can’t manage it, you can’t improve it.
+Measurement is the first step that leads to control and eventually to improvement. If you can’t measure something, you can’t understand it. If you can’t understand it, you can’t control it. If you can’t control it, you can’t improve it.
 
 In this section, we are going to learn the basics of measuring our current code performance and compare it with other algorithms.
 

book/chapters/non-linear-data-structures-intro.adoc

@@ -5,8 +5,8 @@ Non-Linear data structures are everywhere whether you realize it or not. They ar
 .In this chapter we are going to learn:
 - Exciting <<Graph>> data structure applications
 - Searching efficiently with a <<Tree>> data structures.
-- One of the most versatile data structure of all <<HashMaps>>.
-- Keeping dups out with a <<Sets>>.
+- One of the most versatile data structure of all <<HashMap>>.
+- Keeping dups out with a <<Set>>.
 
 By the end of this section, you will know the data structures trade-offs and when to use one over the other.
 --

book/chapters/stack.adoc

@@ -47,7 +47,7 @@ Deleting is straightforward as well.
 include::{codedir}/data-structures/stacks/stack.js[tag=remove, indent=0]
 ----
 
-This time we used the linked list’s `removeLast` method. That’s all we need for a stack implementation. Check out the full implementation https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/stacks/stack.js[here]
+This time we used the linked list’s `removeLast` method. That’s all we need for a stack implementation. Check out the full implementation https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/stacks/stack.js[here].
 
 == Implementation Usage
 

book/chapters/tree--avl.adoc

@@ -57,4 +57,4 @@ include::{codedir}/data-structures/trees/avl-tree.js[tag=balance]
 The first thing we do is to see if one subtree is longer than the other.
 If so, then we check the children balance to determine if need a single or double rotation and in which direction.
 
-You can review <<Tree Roations>> in case you want a refresher.
+You can review <<Tree Rotations>> in case you want a refresher.

book/extensions/asciidoctor-pdf-extensions.rb

@@ -35,7 +35,7 @@ def start_new_chapter chapter
   end
 
   def layout_chapter_title node, title, opts = {}
-    puts node.id
+    puts node.id + ': ' + title
 
     if (sect_id = node.id) == '_dedication' || sect_id == 'acknowledgements'
       layout_heading_custom title, align: :center