IT. Expert System.

Android Reference

SparseBooleanArray


android.util

Class SparseBooleanArray

  • All Implemented Interfaces:
    Cloneable


    public class SparseBooleanArray
    extends Object
    implements Cloneable
    SparseBooleanArrays map integers to booleans. Unlike a normal array of booleans there can be gaps in the indices. It is intended to be more efficient than using a HashMap to map Integers to Booleans.
    • Constructor Summary

      Constructors
      Constructor and Description
      SparseBooleanArray()
      Creates a new SparseBooleanArray containing no mappings.
      SparseBooleanArray(int initialCapacity)
      Creates a new SparseBooleanArray containing no mappings that will not require any additional memory allocation to store the specified number of mappings.
    • Method Summary

      Methods
      Modifier and Type Method and Description
      void append(int key, boolean value)
      Puts a key/value pair into the array, optimizing for the case where the key is greater than all existing keys in the array.
      void clear()
      Removes all key-value mappings from this SparseBooleanArray.
      SparseBooleanArray clone()
      Creates and returns a copy of this Object.
      void delete(int key)
      Removes the mapping from the specified key, if there was any.
      boolean get(int key)
      Gets the boolean mapped from the specified key, or false if no such mapping has been made.
      boolean get(int key, boolean valueIfKeyNotFound)
      Gets the boolean mapped from the specified key, or the specified value if no such mapping has been made.
      int indexOfKey(int key)
      Returns the index for which keyAt(int) would return the specified key, or a negative number if the specified key is not mapped.
      int indexOfValue(boolean value)
      Returns an index for which valueAt(int) would return the specified key, or a negative number if no keys map to the specified value.
      int keyAt(int index)
      Given an index in the range 0...size()-1, returns the key from the indexth key-value mapping that this SparseBooleanArray stores.
      void put(int key, boolean value)
      Adds a mapping from the specified key to the specified value, replacing the previous mapping from the specified key if there was one.
      int size()
      Returns the number of key-value mappings that this SparseBooleanArray currently stores.
      boolean valueAt(int index)
      Given an index in the range 0...size()-1, returns the value from the indexth key-value mapping that this SparseBooleanArray stores.
    • Constructor Detail

      • SparseBooleanArray

        public SparseBooleanArray()
        Creates a new SparseBooleanArray containing no mappings.
      • SparseBooleanArray

        public SparseBooleanArray(int initialCapacity)
        Creates a new SparseBooleanArray containing no mappings that will not require any additional memory allocation to store the specified number of mappings.
    • Method Detail

      • clone

        public SparseBooleanArray clone()
        Description copied from class: Object
        Creates and returns a copy of this Object. The default implementation returns a so-called "shallow" copy: It creates a new instance of the same class and then copies the field values (including object references) from this instance to the new instance. A "deep" copy, in contrast, would also recursively clone nested objects. A subclass that needs to implement this kind of cloning should call super.clone() to create the new instance and then create deep copies of the nested, mutable objects.
        Overrides:
        clone in class Object
        Returns:
        a copy of this object.
      • get

        public boolean get(int key)
        Gets the boolean mapped from the specified key, or false if no such mapping has been made.
      • get

        public boolean get(int key,
                  boolean valueIfKeyNotFound)
        Gets the boolean mapped from the specified key, or the specified value if no such mapping has been made.
      • delete

        public void delete(int key)
        Removes the mapping from the specified key, if there was any.
      • put

        public void put(int key,
               boolean value)
        Adds a mapping from the specified key to the specified value, replacing the previous mapping from the specified key if there was one.
      • size

        public int size()
        Returns the number of key-value mappings that this SparseBooleanArray currently stores.
      • keyAt

        public int keyAt(int index)
        Given an index in the range 0...size()-1, returns the key from the indexth key-value mapping that this SparseBooleanArray stores.
      • valueAt

        public boolean valueAt(int index)
        Given an index in the range 0...size()-1, returns the value from the indexth key-value mapping that this SparseBooleanArray stores.
      • indexOfKey

        public int indexOfKey(int key)
        Returns the index for which keyAt(int) would return the specified key, or a negative number if the specified key is not mapped.
      • indexOfValue

        public int indexOfValue(boolean value)
        Returns an index for which valueAt(int) would return the specified key, or a negative number if no keys map to the specified value. Beware that this is a linear search, unlike lookups by key, and that multiple keys can map to the same value and this will find only one of them.
      • clear

        public void clear()
        Removes all key-value mappings from this SparseBooleanArray.
      • append

        public void append(int key,
                  boolean value)
        Puts a key/value pair into the array, optimizing for the case where the key is greater than all existing keys in the array.


Content

Android Reference

Java basics

Java Enterprise Edition (EE)

Java Standard Edition (SE)

SQL

HTML

PHP

CSS

Java Script

MYSQL

JQUERY

VBS

REGEX

C

C++

C#

Design patterns

RFC (standard status)

RFC (proposed standard status)

RFC (draft standard status)

RFC (informational status)

RFC (experimental status)

RFC (best current practice status)

RFC (historic status)

RFC (unknown status)

IT dictionary

License.
All information of this service is derived from the free sources and is provided solely in the form of quotations. This service provides information and interfaces solely for the familiarization (not ownership) and under the "as is" condition.
Copyright 2016 © ELTASK.COM. All rights reserved.
Site is optimized for mobile devices.
Downloads: 1932 / 159532582. Delta: 0.04552 с