Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 65f400b

Browse files
fix broken references
1 parent e876676 commit 65f400b

File tree

6 files changed

+12
-6
lines changed

6 files changed

+12
-6
lines changed

‎book/book.adoc‎

Lines changed: 6 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -30,6 +30,7 @@ endif::[]
3030
:datadir: {docdir}/data
3131
:source-highlighter: pygments
3232
:pygments-style: xcode
33+
// :chapter-label:
3334

3435

3536
ifndef::ebook-format[:leveloffset: 1]
@@ -48,6 +49,9 @@ include::chapters/preface.adoc[]
4849

4950
// include::chapters/introduction.adoc[]
5051

52+
// TODO: (optional) include numbers but need to fix the part/chapter labels
53+
// :sectnums:
54+
5155
include::chapters/chapter1.adoc[]
5256

5357
include::chapters/chapter2.adoc[]
@@ -56,6 +60,8 @@ include::chapters/chapter3.adoc[]
5660

5761
include::chapters/chapter4.adoc[]
5862

63+
// :sectnums!:
64+
5965
include::chapters/appendix.adoc[]
6066

6167
// include::chapters/epigraph.adoc[]

‎book/chapters/algorithms-analysis.adoc‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -72,7 +72,7 @@ Find bottlenecks of existing software and have an "algorithmic toolbox" to switc
7272
The first step to improve your code performance is to measure it. As somebody said:
7373

7474
[quote, H. J. Harrington]
75-
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.
75+
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.
7676

7777
In this section, we are going to learn the basics of measuring our current code performance and compare it with other algorithms.
7878

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -5,8 +5,8 @@ Non-Linear data structures are everywhere whether you realize it or not. They ar
55
.In this chapter we are going to learn:
66
- Exciting <<Graph>> data structure applications
77
- Searching efficiently with a <<Tree>> data structures.
8-
- One of the most versatile data structure of all <<HashMaps>>.
9-
- Keeping dups out with a <<Sets>>.
8+
- One of the most versatile data structure of all <<HashMap>>.
9+
- Keeping dups out with a <<Set>>.
1010
1111
By the end of this section, you will know the data structures trade-offs and when to use one over the other.
1212
--

‎book/chapters/stack.adoc‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ Deleting is straightforward as well.
4747
include::{codedir}/data-structures/stacks/stack.js[tag=remove, indent=0]
4848
----
4949

50-
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]
50+
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].
5151

5252
== Implementation Usage
5353

‎book/chapters/tree--avl.adoc‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -57,4 +57,4 @@ include::{codedir}/data-structures/trees/avl-tree.js[tag=balance]
5757
The first thing we do is to see if one subtree is longer than the other.
5858
If so, then we check the children balance to determine if need a single or double rotation and in which direction.
5959

60-
You can review <<Tree Roations>> in case you want a refresher.
60+
You can review <<Tree Rotations>> in case you want a refresher.

‎book/extensions/asciidoctor-pdf-extensions.rb‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -35,7 +35,7 @@ def start_new_chapter chapter
3535
end
3636

3737
def layout_chapter_title node, title, opts = {}
38-
puts node.id
38+
puts node.id + ': ' + title
3939

4040
if (sect_id = node.id) == '_dedication' || sect_id == 'acknowledgements'
4141
layout_heading_custom title, align: :center

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /