From 3fba7d16b41dfbefe3b1be6bc0ab94c017728f79 Mon Sep 17 00:00:00 2001 From: rdivacky Date: Fri, 15 Jan 2010 15:37:28 +0000 Subject: Update LLVM to 93512. --- docs/ProgrammersManual.html | 24 ++++++++++++++++++++++-- 1 file changed, 22 insertions(+), 2 deletions(-) (limited to 'docs/ProgrammersManual.html') diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html index c5451b6..80a5db0 100644 --- a/docs/ProgrammersManual.html +++ b/docs/ProgrammersManual.html @@ -94,6 +94,7 @@ option
  • BitVector-like containers
  • @@ -1584,7 +1585,7 @@ please don't use it.

    -

    The BitVector container provides a fixed size set of bits for manipulation. +

    The BitVector container provides a dynamic size set of bits for manipulation. It supports individual bit setting/testing, as well as set operations. The set operations take time O(size of bitvector), but operations are performed one word at a time, instead of one bit at a time. This makes the BitVector very fast for @@ -1595,6 +1596,25 @@ the number of set bits to be high (IE a dense set).

    + +
    +

    The SmallBitVector container provides the same interface as BitVector, but +it is optimized for the case where only a small number of bits, less than +25 or so, are needed. It also transparently supports larger bit counts, but +slightly less efficiently than a plain BitVector, so SmallBitVector should +only be used when larger counts are rare. +

    + +

    +At this time, SmallBitVector does not support set operations (and, or, xor), +and its operator[] does not provide an assignable lvalue. +

    +
    + + + @@ -3872,7 +3892,7 @@ arguments. An argument has a pointer to the parent Function.

    Dinakar Dhurjati and Chris Lattner
    The LLVM Compiler Infrastructure
    - Last modified: $Date: 2009-10-23 00:11:22 +0200 (Fri, 23 Oct 2009) $ + Last modified: $Date: 2010-01-05 19:24:00 +0100 (Tue, 05 Jan 2010) $ -- cgit v1.1