aboutsummaryrefslogtreecommitdiffhomepage
diff options
context:
space:
mode:
authornyamatongwe <unknown>2002-04-04 03:09:05 +0000
committernyamatongwe <unknown>2002-04-04 03:09:05 +0000
commit00bf13a155d265805ccbcb805502ff6408c7f538 (patch)
treefc7a00bbcc154bfc8da68c7cab8df41eb29f2ffb
parent6d23cab37a9ed86db5c240b6a2145b6a7078116b (diff)
downloadscintilla-mirror-00bf13a155d265805ccbcb805502ff6408c7f538.tar.gz
Link to page on Span Table data structure.
-rw-r--r--doc/ScintillaRelated.html8
1 files changed, 7 insertions, 1 deletions
diff --git a/doc/ScintillaRelated.html b/doc/ScintillaRelated.html
index bce884c8b..cbdd380c9 100644
--- a/doc/ScintillaRelated.html
+++ b/doc/ScintillaRelated.html
@@ -201,8 +201,14 @@
component for Win32.
</p>
<h3>
- Paper Documents
+ Documents
</h3>
+
+ <p>
+ <a href="http://freespace.virgin.net/james.brown7/tuts/bigmem02.htm">Span Tables</a>
+ are another data structure that can be used to represent documents in memory in a way
+ that performs well when data is inserted and deleted, <i>James Brown</i>
+ </p>
<p>
<a href="http://www.cs.cmu.edu/~wjh/papers/byte.html">Data Structures in a Bit-Mapped Text
Editor</a>, <i>Wilfred J. Hanson</i>, Byte January 1987