com.amazonaws.services.dynamodbv2.model.LocalSecondaryIndexDescription Maven / Gradle / Ivy
Show all versions of aws-java-sdk-dynamodb Show documentation
/*
* Copyright 2010-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 local secondary index.
*
*/
public class LocalSecondaryIndexDescription implements Serializable, Cloneable {
/**
*
* Represents the name of the local secondary index.
*
*/
private String indexName;
/**
*
* The complete key schema for the local secondary index, consisting 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;
/**
*
* The total size of the specified index, in bytes. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
*
*/
private Long indexSizeBytes;
/**
*
* The number of items in the specified index. DynamoDB updates this value
* approximately every six hours. Recent changes might not be reflected in
* this value.
*
*/
private Long itemCount;
/**
*
* The Amazon Resource Name (ARN) that uniquely identifies the index.
*
*/
private String indexArn;
/**
*
* Represents the name of the local secondary index.
*
*
* @param indexName
* Represents the name of the local secondary index.
*/
public void setIndexName(String indexName) {
this.indexName = indexName;
}
/**
*
* Represents the name of the local secondary index.
*
*
* @return Represents the name of the local secondary index.
*/
public String getIndexName() {
return this.indexName;
}
/**
*
* Represents the name of the local secondary index.
*
*
* @param indexName
* Represents the name of the local secondary index.
* @return Returns a reference to this object so that method calls can be
* chained together.
*/
public LocalSecondaryIndexDescription withIndexName(String indexName) {
setIndexName(indexName);
return this;
}
/**
*
* The complete key schema for the local secondary index, consisting 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 the local secondary index, consisting
* 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 the local secondary index, consisting 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 the local secondary index, consisting
* 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 the local secondary index, consisting 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 the local secondary index, consisting
* 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 LocalSecondaryIndexDescription 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 the local secondary index, consisting 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 the local secondary index, consisting
* 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 LocalSecondaryIndexDescription 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 LocalSecondaryIndexDescription withProjection(Projection projection) {
setProjection(projection);
return this;
}
/**
*
* The total size of the specified index, in bytes. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
*
*
* @param indexSizeBytes
* The total size of the specified index, in bytes. DynamoDB updates
* this value approximately every six hours. Recent changes might not
* be reflected in this value.
*/
public void setIndexSizeBytes(Long indexSizeBytes) {
this.indexSizeBytes = indexSizeBytes;
}
/**
*
* The total size of the specified index, in bytes. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
*
*
* @return The total size of the specified index, in bytes. DynamoDB updates
* this value approximately every six hours. Recent changes might
* not be reflected in this value.
*/
public Long getIndexSizeBytes() {
return this.indexSizeBytes;
}
/**
*
* The total size of the specified index, in bytes. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
*
*
* @param indexSizeBytes
* The total size of the specified index, in bytes. DynamoDB updates
* this value approximately every six hours. Recent changes might not
* be reflected in this value.
* @return Returns a reference to this object so that method calls can be
* chained together.
*/
public LocalSecondaryIndexDescription withIndexSizeBytes(Long indexSizeBytes) {
setIndexSizeBytes(indexSizeBytes);
return this;
}
/**
*
* The number of items in the specified index. DynamoDB updates this value
* approximately every six hours. Recent changes might not be reflected in
* this value.
*
*
* @param itemCount
* The number of items in the specified index. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
*/
public void setItemCount(Long itemCount) {
this.itemCount = itemCount;
}
/**
*
* The number of items in the specified index. DynamoDB updates this value
* approximately every six hours. Recent changes might not be reflected in
* this value.
*
*
* @return The number of items in the specified index. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
*/
public Long getItemCount() {
return this.itemCount;
}
/**
*
* The number of items in the specified index. DynamoDB updates this value
* approximately every six hours. Recent changes might not be reflected in
* this value.
*
*
* @param itemCount
* The number of items in the specified index. DynamoDB updates this
* value approximately every six hours. Recent changes might not be
* reflected in this value.
* @return Returns a reference to this object so that method calls can be
* chained together.
*/
public LocalSecondaryIndexDescription withItemCount(Long itemCount) {
setItemCount(itemCount);
return this;
}
/**
*
* The Amazon Resource Name (ARN) that uniquely identifies the index.
*
*
* @param indexArn
* The Amazon Resource Name (ARN) that uniquely identifies the index.
*/
public void setIndexArn(String indexArn) {
this.indexArn = indexArn;
}
/**
*
* The Amazon Resource Name (ARN) that uniquely identifies the index.
*
*
* @return The Amazon Resource Name (ARN) that uniquely identifies the
* index.
*/
public String getIndexArn() {
return this.indexArn;
}
/**
*
* The Amazon Resource Name (ARN) that uniquely identifies the index.
*
*
* @param indexArn
* The Amazon Resource Name (ARN) that uniquely identifies the index.
* @return Returns a reference to this object so that method calls can be
* chained together.
*/
public LocalSecondaryIndexDescription withIndexArn(String indexArn) {
setIndexArn(indexArn);
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 (getIndexSizeBytes() != null)
sb.append("IndexSizeBytes: " + getIndexSizeBytes() + ",");
if (getItemCount() != null)
sb.append("ItemCount: " + getItemCount() + ",");
if (getIndexArn() != null)
sb.append("IndexArn: " + getIndexArn());
sb.append("}");
return sb.toString();
}
@Override
public boolean equals(Object obj) {
if (this == obj)
return true;
if (obj == null)
return false;
if (obj instanceof LocalSecondaryIndexDescription == false)
return false;
LocalSecondaryIndexDescription other = (LocalSecondaryIndexDescription) 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.getIndexSizeBytes() == null
^ this.getIndexSizeBytes() == null)
return false;
if (other.getIndexSizeBytes() != null
&& other.getIndexSizeBytes().equals(this.getIndexSizeBytes()) == false)
return false;
if (other.getItemCount() == null ^ this.getItemCount() == null)
return false;
if (other.getItemCount() != null
&& other.getItemCount().equals(this.getItemCount()) == false)
return false;
if (other.getIndexArn() == null ^ this.getIndexArn() == null)
return false;
if (other.getIndexArn() != null
&& other.getIndexArn().equals(this.getIndexArn()) == 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
+ ((getIndexSizeBytes() == null) ? 0 : getIndexSizeBytes()
.hashCode());
hashCode = prime * hashCode
+ ((getItemCount() == null) ? 0 : getItemCount().hashCode());
hashCode = prime * hashCode
+ ((getIndexArn() == null) ? 0 : getIndexArn().hashCode());
return hashCode;
}
@Override
public LocalSecondaryIndexDescription clone() {
try {
return (LocalSecondaryIndexDescription) super.clone();
} catch (CloneNotSupportedException e) {
throw new IllegalStateException(
"Got a CloneNotSupportedException from Object.clone() "
+ "even though we're Cloneable!", e);
}
}
}