Files
git.stella-ops.org/local-nuget/roaringbitmap/0.0.9/lib/netstandard1.1/RoaringBitmap.XML
2025-11-17 20:46:40 +02:00

124 lines
5.9 KiB
XML

<?xml version="1.0"?>
<doc>
<assembly>
<name>RoaringBitmap</name>
</assembly>
<members>
<member name="M:Collections.Special.BitmapContainer.op_BitwiseAnd(Collections.Special.BitmapContainer,Collections.Special.BitmapContainer)">
<summary>
Java version has an optimized version of this, but it's using bitcount internally which should make it slower in
.NET
</summary>
</member>
<member name="M:Collections.Special.BitmapContainer.op_ExclusiveOr(Collections.Special.BitmapContainer,Collections.Special.BitmapContainer)">
<summary>
Java version has an optimized version of this, but it's using bitcount internally which should make it slower in
.NET
</summary>
</member>
<member name="M:Collections.Special.RoaringArray.#ctor(System.Int32,System.Collections.Generic.List{System.UInt16},System.Collections.Generic.List{Collections.Special.Container})">
<summary>
Use List directly, because the enumerator is a struct
</summary>
</member>
<member name="M:Collections.Special.RoaringBitmap.Create(System.Int32[])">
<summary>
Creates a new immutable RoaringBitmap from an existing list of integers
</summary>
<param name="values">List of integers</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.Optimize">
<summary>
Optimizes a RoaringBitmap to prepare e.g. for Serialization/Deserialization
</summary>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.Create(System.Collections.Generic.IEnumerable{System.Int32})">
<summary>
Creates a new immutable RoaringBitmap from an existing list of integers
</summary>
<param name="values">List of integers</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.op_BitwiseOr(Collections.Special.RoaringBitmap,Collections.Special.RoaringBitmap)">
<summary>
Bitwise Or operation of two RoaringBitmaps
</summary>
<param name="x">RoaringBitmap</param>
<param name="y">RoaringBitmap</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.op_BitwiseAnd(Collections.Special.RoaringBitmap,Collections.Special.RoaringBitmap)">
<summary>
Bitwise And operation of two RoaringBitmaps
</summary>
<param name="x">RoaringBitmap</param>
<param name="y">RoaringBitmap</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.op_OnesComplement(Collections.Special.RoaringBitmap)">
<summary>
Bitwise Not operation of a RoaringBitmap
</summary>
<param name="x">RoaringBitmap</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.op_ExclusiveOr(Collections.Special.RoaringBitmap,Collections.Special.RoaringBitmap)">
<summary>
Bitwise Xor operation of two RoaringBitmaps
</summary>
<param name="x">RoaringBitmap</param>
<param name="y">RoaringBitmap</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.AndNot(Collections.Special.RoaringBitmap,Collections.Special.RoaringBitmap)">
<summary>
Bitwise AndNot operation of two RoaringBitmaps
</summary>
<param name="x">RoaringBitmap</param>
<param name="y">RoaringBitmap</param>
<returns>RoaringBitmap</returns>
</member>
<member name="M:Collections.Special.RoaringBitmap.Serialize(Collections.Special.RoaringBitmap,System.IO.Stream)">
<summary>
Serializes a RoaringBitmap into a stream using the 'official' RoaringBitmap file format
</summary>
<param name="roaringBitmap">RoaringBitmap</param>
<param name="stream">Stream</param>
</member>
<member name="M:Collections.Special.RoaringBitmap.Deserialize(System.IO.Stream)">
<summary>
Deserializes a RoaringBitmap from astream using the 'official' RoaringBitmap file format
</summary>
<param name="stream">Stream</param>
</member>
<member name="T:Collections.Special.Util">
<summary>
Pretty much everything in here are straight conversions from the original Util class in the java Roaring Bitmap
project.
</summary>
</member>
<member name="M:Collections.Special.Util.BitCount(System.UInt64)">
<summary>
see https://en.wikipedia.org/wiki/Hamming_weight
Unfortunately there is no popcnt in c#
</summary>
</member>
<member name="M:Collections.Special.Util.BitCount(System.UInt64[])">
<summary>
see https://en.wikipedia.org/wiki/Hamming_weight
Unfortunately there is no popcnt in c#
</summary>
</member>
<member name="M:Collections.Special.Util.AdvanceUntil(System.UInt16[],System.Int32,System.Int32,System.UInt16)">
<summary>
Find the smallest integer larger than pos such that array[pos]&gt;= min.
otherwise return length
-> The first line is BinarySearch with pos + 1, the second line is the bitwise complement if the value can't be
found
</summary>
</member>
</members>
</doc>