Oracle America, Inc. v. Google Inc.
Filing 1192
TRIAL BRIEF Google's May 23, 2012 Copyright Liability Trial Brief by Google Inc.. (Attachments: #1 Exhibit A, #2 Exhibit B, #3 Exhibit C, #4 Exhibit D, #5 Exhibit E)(Van Nest, Robert) (Filed on 5/23/2012)
* * Lists (and arrays) of objects that implement this interface can be sorted * automatically by Collections.sort (and Arrays.sort). * Objects that implement this interface can be used as keys in a sorted map * or elements in a sorted set, without the need to specify a comparator.
* * The natural ordering for a class C is said to be consistent * with equals if and only if (e1.compareTo((Object)e2) == 0) has * the same boolean value as e1.equals((Object)e2) for every * e1 and e2 of class C. Note that null * is not an instance of any class, and e.compareTo(null) should * throw a NullPointerException even though e.equals(null) * returns false.
* * It is strongly recommended (though not required) that natural orderings be * consistent with equals. This is so because sorted sets (and sorted maps) * without explicit comparators behave "strangely" when they are used with * elements (or keys) whose natural ordering is inconsistent with equals. In * particular, such a sorted set (or sorted map) violates the general contract * for set (or map), which is defined in terms of the equals * method.
* * For example, if one adds two keys a and b such that * (!a.equals((Object)b) && a.compareTo((Object)b) == 0) to a sorted * set that does not use an explicit comparator, the second add * operation returns false (and the size of the sorted set does not increase) * because a and b are equivalent from the sorted set's * perspective.
* * Virtually all Java core classes that implement comparable have natural * orderings that are consistent with equals. One exception is * java.math.BigDecimal, whose natural ordering equates * BigDecimal objects with equal values and different precisions * (such as 4.0 and 4.00).
* * For the mathematically inclined, the relation that defines * the natural ordering on a given class C is:
* {(x, y) such that x.compareTo((Object)y) <= 0}. *The quotient for this total order is:
* {(x, y) such that x.compareTo((Object)y) == 0}. ** * It follows immediately from the contract for compareTo that the * quotient is an equivalence relation on C, and that the * natural ordering is a total order on C. When we say that a * class's natural ordering is consistent with equals, we mean that the * quotient for the natural ordering is the equivalence relation defined by * the class's equals(Object) method:
* {(x, y) such that x.equals((Object)y)}. *
*
* This interface is a member of the
*
Page 1 of 2
File: /623/OAGOOGLE0100209734_HIGHL…sses/java/lang/Comparable.java
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
* Java Collections Framework.
*
* @author Josh Bloch
* @version 1.22, 12/19/03
* @see java.util.Comparator
* @see java.util.Collections#sort(java.util.List)
* @see java.util.Arrays#sort(Object[])
* @see java.util.SortedSet
* @see java.util.SortedMap
* @see java.util.TreeSet
* @see java.util.TreeMap
* @since 1.2
*/
public interface Comparable
*
* In the foregoing description, the notation
* sgn(expression) designates the mathematical
* signum function, which is defined to return one of -1,
* 0, or 1 according to whether the value of expression
* is negative, zero or positive.
*
* The implementor must ensure sgn(x.compareTo(y)) ==
* -sgn(y.compareTo(x)) for all x and y. (This
* implies that x.compareTo(y) must throw an exception iff
* y.compareTo(x) throws an exception.)
*
* The implementor must also ensure that the relation is transitive:
* (x.compareTo(y)>0 && y.compareTo(z)>0) implies
* x.compareTo(z)>0.
*
* Finally, the implementer must ensure that x.compareTo(y)==0
* implies that sgn(x.compareTo(z)) == sgn(y.compareTo(z)), for
* all z.
*
* It is strongly recommended, but not strictly required that
* (x.compareTo(y)==0) == (x.equals(y)). Generally speaking, any
* class that implements the Comparable interface and violates
* this condition should clearly indicate this fact. The recommended
* language is "Note: this class has a natural ordering that is
* inconsistent with equals."
*
* @param
o the Object to be compared.
* @return a negative integer, zero, or a positive integer as this object
*
is less than, equal to, or greater than the specified object.
*
* @throws ClassCastException if the specified object's type prevents it
*
from being compared to this Object.
*/
public int compareTo(T o);
}
Page 2 of 2
Disclaimer: Justia Dockets & Filings provides public litigation records from the federal appellate and district courts. These filings and docket sheets should not be considered findings of fact or liability, nor do they necessarily reflect the view of Justia.