summaryrefslogtreecommitdiff
path: root/src/main/java/com
diff options
context:
space:
mode:
authorBrian S. O'Neill <bronee@gmail.com>2006-09-05 04:18:48 +0000
committerBrian S. O'Neill <bronee@gmail.com>2006-09-05 04:18:48 +0000
commitf3b3c029be0ecda040e9ef461df2f66008351269 (patch)
tree8ca802c8f9d141a3a24c9c57b303cde1b5f21573 /src/main/java/com
parent84a22c3b1003a29344859b8af286e37bbe4c7b21 (diff)
comment typo
Diffstat (limited to 'src/main/java/com')
-rw-r--r--src/main/java/com/amazon/carbonado/layout/LayoutFactory.java4
-rw-r--r--src/main/java/com/amazon/carbonado/qe/OrderingScore.java6
-rw-r--r--src/main/java/com/amazon/carbonado/qe/UnionQueryAnalyzer.java4
3 files changed, 7 insertions, 7 deletions
diff --git a/src/main/java/com/amazon/carbonado/layout/LayoutFactory.java b/src/main/java/com/amazon/carbonado/layout/LayoutFactory.java
index 3557db0..8a0ede8 100644
--- a/src/main/java/com/amazon/carbonado/layout/LayoutFactory.java
+++ b/src/main/java/com/amazon/carbonado/layout/LayoutFactory.java
@@ -179,7 +179,7 @@ public class LayoutFactory implements LayoutCapability {
}
/**
- * Creates a long hash code that attempts to mix in all relevent layout
+ * Creates a long hash code that attempts to mix in all relevant layout
* elements.
*/
private long mixInHash(long hash, StorableInfo<?> info, int multiplier) {
@@ -195,7 +195,7 @@ public class LayoutFactory implements LayoutCapability {
}
/**
- * Creates a long hash code that attempts to mix in all relevent layout
+ * Creates a long hash code that attempts to mix in all relevant layout
* elements.
*/
private long mixInHash(long hash, StorableProperty<?> property, int multiplier) {
diff --git a/src/main/java/com/amazon/carbonado/qe/OrderingScore.java b/src/main/java/com/amazon/carbonado/qe/OrderingScore.java
index 0730b4f..82d44a7 100644
--- a/src/main/java/com/amazon/carbonado/qe/OrderingScore.java
+++ b/src/main/java/com/amazon/carbonado/qe/OrderingScore.java
@@ -146,7 +146,7 @@ public class OrderingScore<S extends Storable> {
for (int i=0; i<indexProperties.length; i++) {
ChainedProperty<S> indexChained = indexProperties[i].getChainedProperty();
if (!identityPropSet.contains(indexChained)) {
- // Missed a property, so ordering is still relevent.
+ // Missed a property, so ordering is still relevant.
break uniquelyCheck;
}
}
@@ -391,7 +391,7 @@ public class OrderingScore<S extends Storable> {
* Returns potential ordering properties that the evaluated index can
* handle, if arranged to immediately follow the handled orderings. The
* direction of any free orderings may be UNSPECIFIED, which indicates that
- * specific order is not relevent.
+ * specific order is not relevant.
*
* @return free orderings, never null
*/
@@ -402,7 +402,7 @@ public class OrderingScore<S extends Storable> {
/**
* Returns unused ordering properties of the evaluated index because they
* were filtered out. The direction of each unused ordering is UNSPECIFIED
- * because specific order is not relevent.
+ * because specific order is not relevant.
*
* @return unused orderings, never null
*/
diff --git a/src/main/java/com/amazon/carbonado/qe/UnionQueryAnalyzer.java b/src/main/java/com/amazon/carbonado/qe/UnionQueryAnalyzer.java
index 2fd492e..81779b0 100644
--- a/src/main/java/com/amazon/carbonado/qe/UnionQueryAnalyzer.java
+++ b/src/main/java/com/amazon/carbonado/qe/UnionQueryAnalyzer.java
@@ -102,7 +102,7 @@ public class UnionQueryAnalyzer<S extends Storable> {
}
private boolean isTotalOrdering(List<OrderedProperty<S>> orderings) {
- // First strip out directions, since they are not relevent here.
+ // First strip out directions, since they are not relevant here.
List<ChainedProperty<S>> properties = new ArrayList<ChainedProperty<S>>(orderings.size());
for (OrderedProperty<S> ordering : orderings) {
properties.add(ordering.getChainedProperty());
@@ -131,7 +131,7 @@ public class UnionQueryAnalyzer<S extends Storable> {
return false;
}
- // Strip out directions, since they are not relevent here.
+ // Strip out directions, since they are not relevant here.
Set<ChainedProperty<S>> keyProps = new HashSet<ChainedProperty<S>>(orderedKeyProps.size());
for (OrderedProperty<S> ordering : orderedKeyProps) {
keyProps.add(ordering.getChainedProperty());