From 2fdd005d9799289bb2fc96ec0fe92819a4b75bd8 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Tue, 15 Nov 2011 22:40:14 +0000 Subject: [PATCH] add ImmutableSet/Map dox, patch by Caitlin Sadowski! git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@144716 91177308-0d34-0410-b5e6-96231b3b80d8 --- docs/ProgrammersManual.html | 46 ++++++++++++++++++++++++++++++++++++- 1 file changed, 45 insertions(+), 1 deletion(-) diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index 2ab1681c47c..51862034b73 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -85,7 +85,8 @@ option
  • <set>
  • "llvm/ADT/SetVector.h"
  • "llvm/ADT/UniqueVector.h"
  • -
  • Other Set-Like ContainerOptions
  • +
  • "llvm/ADT/ImmutableSet.h"
  • +
  • Other Set-Like Container Options
  • Map-Like Containers (std::map, DenseMap, etc)
  • BitVector-like containers @@ -1608,6 +1610,29 @@ factors, and produces a lot of malloc traffic. It should be avoided.

    + +

    + "llvm/ADT/ImmutableSet.h" +

    + +
    + +

    +ImmutableSet is an immutable (functional) set implementation based on an AVL +tree. +Adding or removing elements is done through a Factory object and results in the +creation of a new ImmutableSet object. +If an ImmutableSet already exists with the given contents, then the existing one +is returned; equality is compared with a FoldingSetNodeID. +The time and space complexity of add or remove operations is logarithmic in the +size of the original set. + +

    +There is no method for returning an element of the set, you can only check for +membership. + +

    +

    @@ -1812,6 +1837,25 @@ it can be edited again.

    + +

    + "llvm/ADT/ImmutableMap.h" +

    + +
    + +

    +ImmutableMap is an immutable (functional) map implementation based on an AVL +tree. +Adding or removing elements is done through a Factory object and results in the +creation of a new ImmutableMap object. +If an ImmutableMap already exists with the given key set, then the existing one +is returned; equality is compared with a FoldingSetNodeID. +The time and space complexity of add or remove operations is logarithmic in the +size of the original map. + +

    +

    Other Map-Like Container Options