All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.amazonaws.services.dynamodbv2.model.GlobalSecondaryIndex Maven / Gradle / Ivy

Go to download

The AWS SDK for Java with support for OSGi. The AWS SDK for Java provides Java APIs for building software on AWS' cost-effective, scalable, and reliable infrastructure products. The AWS Java SDK allows developers to code against APIs for all of Amazon's infrastructure web services (Amazon S3, Amazon EC2, Amazon SQS, Amazon Relational Database Service, Amazon AutoScaling, etc).

There is a newer version: 1.11.60
Show newest version
/*
 * Copyright 2011-2016 Amazon.com, Inc. or its affiliates. All Rights Reserved.
 * 
 * Licensed under the Apache License, Version 2.0 (the "License"). You may not
 * use this file except in compliance with the License. A copy of the License is
 * located at
 * 
 * http://aws.amazon.com/apache2.0
 * 
 * or in the "license" file accompanying this file. This file is distributed on
 * an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
 * express or implied. See the License for the specific language governing
 * permissions and limitations under the License.
 */
package com.amazonaws.services.dynamodbv2.model;

import java.io.Serializable;

/**
 * 

* Represents the properties of a global secondary index. *

*/ public class GlobalSecondaryIndex implements Serializable, Cloneable { /** *

* The name of the global secondary index. The name must be unique among all * other indexes on this table. *

*/ private String indexName; /** *

* The complete key schema for a global secondary index, which consists of * one or more pairs of attribute names and key types: *

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash attribute. * The term "hash attribute" derives from DynamoDB' usage of an internal * hash function to evenly distribute data items across partitions, based on * their partition key values. *

*

* The sort key of an item is also known as its range attribute. The * term "range attribute" derives from the way DynamoDB stores items with * the same partition key physically close together, in sorted order by the * sort key value. *

*
*/ private java.util.List keySchema; private Projection projection; private ProvisionedThroughput provisionedThroughput; /** *

* The name of the global secondary index. The name must be unique among all * other indexes on this table. *

* * @param indexName * The name of the global secondary index. The name must be unique * among all other indexes on this table. */ public void setIndexName(String indexName) { this.indexName = indexName; } /** *

* The name of the global secondary index. The name must be unique among all * other indexes on this table. *

* * @return The name of the global secondary index. The name must be unique * among all other indexes on this table. */ public String getIndexName() { return this.indexName; } /** *

* The name of the global secondary index. The name must be unique among all * other indexes on this table. *

* * @param indexName * The name of the global secondary index. The name must be unique * among all other indexes on this table. * @return Returns a reference to this object so that method calls can be * chained together. */ public GlobalSecondaryIndex withIndexName(String indexName) { setIndexName(indexName); return this; } /** *

* The complete key schema for a global secondary index, which consists of * one or more pairs of attribute names and key types: *

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash attribute. * The term "hash attribute" derives from DynamoDB' usage of an internal * hash function to evenly distribute data items across partitions, based on * their partition key values. *

*

* The sort key of an item is also known as its range attribute. The * term "range attribute" derives from the way DynamoDB stores items with * the same partition key physically close together, in sorted order by the * sort key value. *

*
* * @return The complete key schema for a global secondary index, which * consists of one or more pairs of attribute names and key * types:

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash * attribute. The term "hash attribute" derives from DynamoDB' * usage of an internal hash function to evenly distribute data * items across partitions, based on their partition key values. *

*

* The sort key of an item is also known as its range * attribute. The term "range attribute" derives from the way * DynamoDB stores items with the same partition key physically * close together, in sorted order by the sort key value. *

*/ public java.util.List getKeySchema() { return keySchema; } /** *

* The complete key schema for a global secondary index, which consists of * one or more pairs of attribute names and key types: *

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash attribute. * The term "hash attribute" derives from DynamoDB' usage of an internal * hash function to evenly distribute data items across partitions, based on * their partition key values. *

*

* The sort key of an item is also known as its range attribute. The * term "range attribute" derives from the way DynamoDB stores items with * the same partition key physically close together, in sorted order by the * sort key value. *

*
* * @param keySchema * The complete key schema for a global secondary index, which * consists of one or more pairs of attribute names and key * types:

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash * attribute. The term "hash attribute" derives from DynamoDB' * usage of an internal hash function to evenly distribute data items * across partitions, based on their partition key values. *

*

* The sort key of an item is also known as its range * attribute. The term "range attribute" derives from the way * DynamoDB stores items with the same partition key physically close * together, in sorted order by the sort key value. *

*/ public void setKeySchema(java.util.Collection keySchema) { if (keySchema == null) { this.keySchema = null; return; } this.keySchema = new java.util.ArrayList(keySchema); } /** *

* The complete key schema for a global secondary index, which consists of * one or more pairs of attribute names and key types: *

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash attribute. * The term "hash attribute" derives from DynamoDB' usage of an internal * hash function to evenly distribute data items across partitions, based on * their partition key values. *

*

* The sort key of an item is also known as its range attribute. The * term "range attribute" derives from the way DynamoDB stores items with * the same partition key physically close together, in sorted order by the * sort key value. *

*
*

* NOTE: This method appends the values to the existing list (if * any). Use {@link #setKeySchema(java.util.Collection)} or * {@link #withKeySchema(java.util.Collection)} if you want to override the * existing values. *

* * @param keySchema * The complete key schema for a global secondary index, which * consists of one or more pairs of attribute names and key * types:

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash * attribute. The term "hash attribute" derives from DynamoDB' * usage of an internal hash function to evenly distribute data items * across partitions, based on their partition key values. *

*

* The sort key of an item is also known as its range * attribute. The term "range attribute" derives from the way * DynamoDB stores items with the same partition key physically close * together, in sorted order by the sort key value. *

* @return Returns a reference to this object so that method calls can be * chained together. */ public GlobalSecondaryIndex withKeySchema(KeySchemaElement... keySchema) { if (this.keySchema == null) { setKeySchema(new java.util.ArrayList( keySchema.length)); } for (KeySchemaElement ele : keySchema) { this.keySchema.add(ele); } return this; } /** *

* The complete key schema for a global secondary index, which consists of * one or more pairs of attribute names and key types: *

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash attribute. * The term "hash attribute" derives from DynamoDB' usage of an internal * hash function to evenly distribute data items across partitions, based on * their partition key values. *

*

* The sort key of an item is also known as its range attribute. The * term "range attribute" derives from the way DynamoDB stores items with * the same partition key physically close together, in sorted order by the * sort key value. *

*
* * @param keySchema * The complete key schema for a global secondary index, which * consists of one or more pairs of attribute names and key * types:

*
    *
  • *

    * HASH - partition key *

    *
  • *
  • *

    * RANGE - sort key *

    *
  • *
* *

* The partition key of an item is also known as its hash * attribute. The term "hash attribute" derives from DynamoDB' * usage of an internal hash function to evenly distribute data items * across partitions, based on their partition key values. *

*

* The sort key of an item is also known as its range * attribute. The term "range attribute" derives from the way * DynamoDB stores items with the same partition key physically close * together, in sorted order by the sort key value. *

* @return Returns a reference to this object so that method calls can be * chained together. */ public GlobalSecondaryIndex withKeySchema( java.util.Collection keySchema) { setKeySchema(keySchema); return this; } /** * @param projection */ public void setProjection(Projection projection) { this.projection = projection; } /** * @return */ public Projection getProjection() { return this.projection; } /** * @param projection * @return Returns a reference to this object so that method calls can be * chained together. */ public GlobalSecondaryIndex withProjection(Projection projection) { setProjection(projection); return this; } /** * @param provisionedThroughput */ public void setProvisionedThroughput( ProvisionedThroughput provisionedThroughput) { this.provisionedThroughput = provisionedThroughput; } /** * @return */ public ProvisionedThroughput getProvisionedThroughput() { return this.provisionedThroughput; } /** * @param provisionedThroughput * @return Returns a reference to this object so that method calls can be * chained together. */ public GlobalSecondaryIndex withProvisionedThroughput( ProvisionedThroughput provisionedThroughput) { setProvisionedThroughput(provisionedThroughput); return this; } /** * Returns a string representation of this object; useful for testing and * debugging. * * @return A string representation of this object. * * @see java.lang.Object#toString() */ @Override public String toString() { StringBuilder sb = new StringBuilder(); sb.append("{"); if (getIndexName() != null) sb.append("IndexName: " + getIndexName() + ","); if (getKeySchema() != null) sb.append("KeySchema: " + getKeySchema() + ","); if (getProjection() != null) sb.append("Projection: " + getProjection() + ","); if (getProvisionedThroughput() != null) sb.append("ProvisionedThroughput: " + getProvisionedThroughput()); sb.append("}"); return sb.toString(); } @Override public boolean equals(Object obj) { if (this == obj) return true; if (obj == null) return false; if (obj instanceof GlobalSecondaryIndex == false) return false; GlobalSecondaryIndex other = (GlobalSecondaryIndex) obj; if (other.getIndexName() == null ^ this.getIndexName() == null) return false; if (other.getIndexName() != null && other.getIndexName().equals(this.getIndexName()) == false) return false; if (other.getKeySchema() == null ^ this.getKeySchema() == null) return false; if (other.getKeySchema() != null && other.getKeySchema().equals(this.getKeySchema()) == false) return false; if (other.getProjection() == null ^ this.getProjection() == null) return false; if (other.getProjection() != null && other.getProjection().equals(this.getProjection()) == false) return false; if (other.getProvisionedThroughput() == null ^ this.getProvisionedThroughput() == null) return false; if (other.getProvisionedThroughput() != null && other.getProvisionedThroughput().equals( this.getProvisionedThroughput()) == false) return false; return true; } @Override public int hashCode() { final int prime = 31; int hashCode = 1; hashCode = prime * hashCode + ((getIndexName() == null) ? 0 : getIndexName().hashCode()); hashCode = prime * hashCode + ((getKeySchema() == null) ? 0 : getKeySchema().hashCode()); hashCode = prime * hashCode + ((getProjection() == null) ? 0 : getProjection().hashCode()); hashCode = prime * hashCode + ((getProvisionedThroughput() == null) ? 0 : getProvisionedThroughput().hashCode()); return hashCode; } @Override public GlobalSecondaryIndex clone() { try { return (GlobalSecondaryIndex) super.clone(); } catch (CloneNotSupportedException e) { throw new IllegalStateException( "Got a CloneNotSupportedException from Object.clone() " + "even though we're Cloneable!", e); } } }




© 2015 - 2025 Weber Informatics LLC | Privacy Policy