Skip to content

Commit 2a109ad

Browse files
meooow25meooow25
authored
Update references (#1039)
* Add or update links * Correct some titles * Add a reference to "Balancing weight-balanced trees"
1 parent 9e0bcc4 commit 2a109ad

File tree

10 files changed

+79
-40
lines changed

10 files changed

+79
-40
lines changed

‎containers/src/Data/Graph.hs

Lines changed: 5 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -36,8 +36,11 @@
3636
--
3737
-- The implementation is based on
3838
--
39-
-- * /Structuring Depth-First Search Algorithms in Haskell/,
40-
-- by David King and John Launchbury, <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.6526>
39+
-- * David King and John Launchbury,
40+
-- \"/Structuring Depth-First Search Algorithms in Haskell/\",
41+
-- Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of
42+
-- Programming Languages, 344-354, 1995,
43+
-- <https://doi.org/10.1145/199448.199530>.
4144
--
4245
-----------------------------------------------------------------------------
4346

‎containers/src/Data/IntMap.hs

Lines changed: 7 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -41,12 +41,15 @@
4141
-- (much) faster on insertions and deletions when compared to a generic
4242
-- size-balanced map implementation (see "Data.Map").
4343
--
44-
-- * Chris Okasaki and Andy Gill, \"/Fast Mergeable Integer Maps/\",
44+
-- * Chris Okasaki and Andy Gill,
45+
-- \"/Fast Mergeable Integer Maps/\",
4546
-- Workshop on ML, September 1998, pages 77-86,
46-
-- <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452>
47+
-- <https://web.archive.org/web/20150417234429/https://ittc.ku.edu/~andygill/papers/IntMap98.pdf>.
4748
--
48-
-- * D.R. Morrison, \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
49-
-- Journal of the ACM, 15(4), October 1968, pages 514-534.
49+
-- * D.R. Morrison,
50+
-- \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
51+
-- Journal of the ACM, 15(4), October 1968, pages 514-534,
52+
-- <https://doi.org/10.1145/321479.321481>.
5053
--
5154
-- Operation comments contain the operation time complexity in
5255
-- the Big-O notation <http://en.wikipedia.org/wiki/Big_O_notation>.

‎containers/src/Data/IntMap/Lazy.hs

Lines changed: 7 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -56,12 +56,15 @@
5656
-- on insertions and deletions when compared to a generic size-balanced map
5757
-- implementation (see "Data.Map").
5858
--
59-
-- * Chris Okasaki and Andy Gill, \"/Fast Mergeable Integer Maps/\",
59+
-- * Chris Okasaki and Andy Gill,
60+
-- \"/Fast Mergeable Integer Maps/\",
6061
-- Workshop on ML, September 1998, pages 77-86,
61-
-- <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452>
62+
-- <https://web.archive.org/web/20150417234429/https://ittc.ku.edu/~andygill/papers/IntMap98.pdf>.
6263
--
63-
-- * D.R. Morrison, \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
64-
-- Journal of the ACM, 15(4), October 1968, pages 514-534.
64+
-- * D.R. Morrison,
65+
-- \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
66+
-- Journal of the ACM, 15(4), October 1968, pages 514-534,
67+
-- <https://doi.org/10.1145/321479.321481>.
6568
--
6669
-----------------------------------------------------------------------------
6770

‎containers/src/Data/IntMap/Strict.hs

Lines changed: 7 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -73,12 +73,15 @@
7373
-- on insertions and deletions when compared to a generic size-balanced map
7474
-- implementation (see "Data.Map").
7575
--
76-
-- * Chris Okasaki and Andy Gill, \"/Fast Mergeable Integer Maps/\",
76+
-- * Chris Okasaki and Andy Gill,
77+
-- \"/Fast Mergeable Integer Maps/\",
7778
-- Workshop on ML, September 1998, pages 77-86,
78-
-- <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452>
79+
-- <https://web.archive.org/web/20150417234429/https://ittc.ku.edu/~andygill/papers/IntMap98.pdf>.
7980
--
80-
-- * D.R. Morrison, \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
81-
-- Journal of the ACM, 15(4), October 1968, pages 514-534.
81+
-- * D.R. Morrison,
82+
-- \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
83+
-- Journal of the ACM, 15(4), October 1968, pages 514-534,
84+
-- <https://doi.org/10.1145/321479.321481>.
8285
--
8386
-----------------------------------------------------------------------------
8487

‎containers/src/Data/IntSet.hs

Lines changed: 7 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -46,12 +46,15 @@
4646
-- (much) faster on insertions and deletions when compared to a generic
4747
-- size-balanced set implementation (see "Data.Set").
4848
--
49-
-- * Chris Okasaki and Andy Gill, \"/Fast Mergeable Integer Maps/\",
49+
-- * Chris Okasaki and Andy Gill,
50+
-- \"/Fast Mergeable Integer Maps/\",
5051
-- Workshop on ML, September 1998, pages 77-86,
51-
-- <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.5452>
52+
-- <https://web.archive.org/web/20150417234429/https://ittc.ku.edu/~andygill/papers/IntMap98.pdf>.
5253
--
53-
-- * D.R. Morrison, \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
54-
-- Journal of the ACM, 15(4), October 1968, pages 514-534.
54+
-- * D.R. Morrison,
55+
-- \"/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/\",
56+
-- Journal of the ACM, 15(4), October 1968, pages 514-534,
57+
-- <https://doi.org/10.1145/321479.321481>.
5558
--
5659
-- Additionally, this implementation places bitmaps in the leaves of the tree.
5760
-- Their size is the natural size of a machine word (32 or 64 bits) and greatly

‎containers/src/Data/Map.hs

Lines changed: 11 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -36,19 +36,25 @@
3636
-- The implementation of 'Map' is based on /size balanced/ binary trees (or
3737
-- trees of /bounded balance/) as described by:
3838
--
39-
-- * Stephen Adams, \"/Efficient sets: a balancing act/\",
40-
-- Journal of Functional Programming 3(4):553-562, October 1993,
41-
-- <http://www.swiss.ai.mit.edu/~adams/BB/>.
39+
-- * Stephen Adams, \"/Efficient sets—a balancing act/\",
40+
-- Journal of Functional Programming 3(4):553-562, October 1993,
41+
-- <https://doi.org/10.1017/S0956796800000885>,
42+
-- <https://groups.csail.mit.edu/mac/users/adams/BB/index.html>.
4243
-- * J. Nievergelt and E.M. Reingold,
4344
-- \"/Binary search trees of bounded balance/\",
4445
-- SIAM journal of computing 2(1), March 1973.
46+
-- <https://doi.org/10.1137/0202005>.
47+
-- * Yoichi Hirai and Kazuhiko Yamamoto,
48+
-- \"/Balancing weight-balanced trees/\",
49+
-- Journal of Functional Programming 21(3):287-307, 2011,
50+
-- <https://doi.org/10.1017/S0956796811000104>
4551
--
4652
-- Bounds for 'union', 'intersection', and 'difference' are as given
4753
-- by
4854
--
4955
-- * Guy Blelloch, Daniel Ferizovic, and Yihan Sun,
50-
-- \"/Just Join for Parallel Ordered Sets/\",
51-
-- <https://arxiv.org/abs/1602.02120v3>.
56+
-- \"/Parallel Ordered Sets Using Join/\",
57+
-- <https://arxiv.org/abs/1602.02120v4>.
5258
--
5359
-- Note that the implementation is /left-biased/ -- the elements of a
5460
-- first argument are always preferred to the second, for example in

‎containers/src/Data/Map/Lazy.hs

Lines changed: 11 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -68,19 +68,25 @@
6868
-- The implementation of 'Map' is based on /size balanced/ binary trees (or
6969
-- trees of /bounded balance/) as described by:
7070
--
71-
-- * Stephen Adams, \"/Efficient sets: a balancing act/\",
72-
-- Journal of Functional Programming 3(4):553-562, October 1993,
73-
-- <http://www.swiss.ai.mit.edu/~adams/BB/>.
71+
-- * Stephen Adams, \"/Efficient sets—a balancing act/\",
72+
-- Journal of Functional Programming 3(4):553-562, October 1993,
73+
-- <https://doi.org/10.1017/S0956796800000885>,
74+
-- <https://groups.csail.mit.edu/mac/users/adams/BB/index.html>.
7475
-- * J. Nievergelt and E.M. Reingold,
7576
-- \"/Binary search trees of bounded balance/\",
7677
-- SIAM journal of computing 2(1), March 1973.
78+
-- <https://doi.org/10.1137/0202005>.
79+
-- * Yoichi Hirai and Kazuhiko Yamamoto,
80+
-- \"/Balancing weight-balanced trees/\",
81+
-- Journal of Functional Programming 21(3):287-307, 2011,
82+
-- <https://doi.org/10.1017/S0956796811000104>
7783
--
7884
-- Bounds for 'union', 'intersection', and 'difference' are as given
7985
-- by
8086
--
8187
-- * Guy Blelloch, Daniel Ferizovic, and Yihan Sun,
82-
-- \"/Just Join for Parallel Ordered Sets/\",
83-
-- <https://arxiv.org/abs/1602.02120v3>.
88+
-- \"/Parallel Ordered Sets Using Join/\",
89+
-- <https://arxiv.org/abs/1602.02120v4>.
8490
--
8591
-----------------------------------------------------------------------------
8692

‎containers/src/Data/Map/Strict.hs

Lines changed: 11 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -80,19 +80,25 @@
8080
-- The implementation of 'Map' is based on /size balanced/ binary trees (or
8181
-- trees of /bounded balance/) as described by:
8282
--
83-
-- * Stephen Adams, \"/Efficient sets: a balancing act/\",
84-
-- Journal of Functional Programming 3(4):553-562, October 1993,
85-
-- <http://www.swiss.ai.mit.edu/~adams/BB/>.
83+
-- * Stephen Adams, \"/Efficient sets—a balancing act/\",
84+
-- Journal of Functional Programming 3(4):553-562, October 1993,
85+
-- <https://doi.org/10.1017/S0956796800000885>,
86+
-- <https://groups.csail.mit.edu/mac/users/adams/BB/index.html>.
8687
-- * J. Nievergelt and E.M. Reingold,
8788
-- \"/Binary search trees of bounded balance/\",
8889
-- SIAM journal of computing 2(1), March 1973.
90+
-- <https://doi.org/10.1137/0202005>.
91+
-- * Yoichi Hirai and Kazuhiko Yamamoto,
92+
-- \"/Balancing weight-balanced trees/\",
93+
-- Journal of Functional Programming 21(3):287-307, 2011,
94+
-- <https://doi.org/10.1017/S0956796811000104>
8995
--
9096
-- Bounds for 'union', 'intersection', and 'difference' are as given
9197
-- by
9298
--
9399
-- * Guy Blelloch, Daniel Ferizovic, and Yihan Sun,
94-
-- \"/Just Join for Parallel Ordered Sets/\",
95-
-- <https://arxiv.org/abs/1602.02120v3>.
100+
-- \"/Parallel Ordered Sets Using Join/\",
101+
-- <https://arxiv.org/abs/1602.02120v4>.
96102
--
97103
--
98104
-----------------------------------------------------------------------------

‎containers/src/Data/Sequence.hs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -127,9 +127,9 @@
127127
-- as described in section 4.2 of
128128
--
129129
-- * Ralf Hinze and Ross Paterson,
130-
-- [\"Finger trees: a simple general-purpose data structure\"]
131-
-- (http://staff.city.ac.uk/~ross/papers/FingerTree.html),
132-
-- /Journal of Functional Programming/ 16:2 (2006) pp 197-217.
130+
-- \"/Finger trees: a simple general-purpose data structure/\",
131+
-- Journal of Functional Programming 16:2 (2006) pp 197-217.
132+
-- <http://staff.city.ac.uk/~ross/papers/FingerTree.html>.
133133
--
134134
-----------------------------------------------------------------------------
135135

‎containers/src/Data/Set.hs

Lines changed: 10 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -48,19 +48,25 @@
4848
-- The implementation of 'Set' is based on /size balanced/ binary trees (or
4949
-- trees of /bounded balance/) as described by:
5050
--
51-
-- * Stephen Adams, \"/Efficient sets: a balancing act/\",
51+
-- * Stephen Adams, \"/Efficient sets—a balancing act/\",
5252
-- Journal of Functional Programming 3(4):553-562, October 1993,
53-
-- <http://www.swiss.ai.mit.edu/~adams/BB/>.
53+
-- <https://doi.org/10.1017/S0956796800000885>,
54+
-- <https://groups.csail.mit.edu/mac/users/adams/BB/index.html>.
5455
-- * J. Nievergelt and E.M. Reingold,
5556
-- \"/Binary search trees of bounded balance/\",
5657
-- SIAM journal of computing 2(1), March 1973.
58+
-- <https://doi.org/10.1137/0202005>.
59+
-- * Yoichi Hirai and Kazuhiko Yamamoto,
60+
-- \"/Balancing weight-balanced trees/\",
61+
-- Journal of Functional Programming 21(3):287-307, 2011,
62+
-- <https://doi.org/10.1017/S0956796811000104>
5763
--
5864
-- Bounds for 'union', 'intersection', and 'difference' are as given
5965
-- by
6066
--
6167
-- * Guy Blelloch, Daniel Ferizovic, and Yihan Sun,
62-
-- \"/Just Join for Parallel Ordered Sets/\",
63-
-- <https://arxiv.org/abs/1602.02120v3>.
68+
-- \"/Parallel Ordered Sets Using Join/\",
69+
-- <https://arxiv.org/abs/1602.02120v4>.
6470
--
6571
-----------------------------------------------------------------------------
6672

0 commit comments

Comments
 (0)