Commit c0f51118 authored by Martin Mareš's avatar Martin Mareš
Browse files

The Big Merge

parent c23efdce
\ifx\chapter\undefined
\input adsmac.tex
\singlechapter{42}
\singlechapter{50}
\fi
\def\TODO{{\bf TODO}}
......
\ifx\chapter\undefined
\input adsmac.tex
\singlechapter{90}
\singlechapter{51}
\fi
\chapter[dynamic]{Dynamization}
......
\ifx\chapter\undefined
\input adsmac.tex
\singlechapter{9}
\singlechapter{52}
\fi
\chapter[persist]{Persistence}
......@@ -240,6 +240,8 @@ Some common types of binary search trees like red-black trees or weak-AVL trees
\: In semi-persistence it was not needed to store all information about nodes. It was sufficient to store pointers to children, key, and value for older versions. Fields useful for balancing were not needed for older versions. This is not true for full-persistence. All information must be stored.
\endlist
\section{List Ordering}
Moving from semi-persistence to full persistence we encounter an obstacle -- versions no longer form an implicit linear order.
......
TOP=..
PICS=sole sole_boxes sole_hilevel mixer composition mixer_chain mixer_tree tree_shapes
include ../Makerules
sole.pdf:: succinct_common.asy
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment