Trait/Object

org.locationtech.geomesa.fs.storage.api

PartitionScheme

Related Docs: object PartitionScheme | package api

Permalink

trait PartitionScheme extends AnyRef

Scheme for partitioning features into various named partitions (e.g. file paths) on disk, for faster querying. Partition schemes do not have any persistent state, they only know how to map features and filters to partition names

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PartitionScheme
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def depth: Int

    Permalink

    returns

    the max depth this partition scheme goes to

  2. abstract def getPartitionName(feature: SimpleFeature): String

    Permalink

    Return the partition in which a SimpleFeature should be stored

    Return the partition in which a SimpleFeature should be stored

    feature

    simple feature

    returns

    partition name

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  7. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  8. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  10. def getCoveringFilter(partition: String): Filter

    Permalink

    Get a filter that will cover a partitions, i.e.

    Get a filter that will cover a partitions, i.e. the filter will return all features in the given partition and none from other partitions

    partition

    partition to cover

    returns

    filter

  11. def getIntersectingPartitions(filter: Filter): Option[Seq[String]]

    Permalink

    Get partitions that intersect the given filter

    Get partitions that intersect the given filter

    If the filter does not constrain partitions at all, then an empty option will be returned. If the filter excludes all potential partitions, then an empty list will be returned

    filter

    filter

    returns

    list of intersecting filters

  12. def getSimplifiedFilters(filter: Filter, partition: Option[String] = None): Option[Seq[SimplifiedFilter]]

    Permalink

    Return a list of modified filters and partitions.

    Return a list of modified filters and partitions. Each filter will have been simplified to remove any predicates that are implicitly true for the associated partitions

    If the filter does not constrain partitions at all, then an empty option will be returned, indicating all partitions must be searched. If the filter excludes all potential partitions, then an empty list of partitions will be returned

    Note that this operation is based solely on the partition scheme, so may return partitions that do not actually exist in a given storage instance

    filter

    filter

    partition

    query a single partition

    returns

    list of simplified filters and partitions

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. def pattern: String

    Permalink

    Indication of the directory structure, suitable for displaying to a user

  19. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  20. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  21. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  22. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped