From: Chris Lattner
Date: Sat, 25 Jul 2009 07:22:20 +0000 (+0000)
Subject: eventually we should describe string options in the data structures section
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=dced9fb219ba4aa8f0de0c960b9666bd4055c7ae;p=oota-llvm.git
eventually we should describe string options in the data structures section
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@77054 91177308-0d34-0410-b5e6-96231b3b80d8
---
diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html
index e3d4e95a262..8c6b36be318 100644
--- a/docs/ProgrammersManual.html
+++ b/docs/ProgrammersManual.html
@@ -85,6 +85,10 @@ option
@@ -833,6 +837,10 @@ access the container. Based on that, you should use:
iteration, but do not support efficient look-up based on a key.
+
a string container is a specialized sequential
+ container or reference structure that is used for character or byte
+ arrays.
+
a bit container provides an efficient way to store and
perform set operations on sets of numeric id's, while automatically
eliminating duplicates. Bit containers require a maximum of 1 bit for each
@@ -1504,6 +1512,20 @@ always better.
+
+