Created
August 28, 2012 01:14
-
-
Save mailtoharshit/3494057 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Map<PairNumbers, String> m = new Map<PairNumbers, String>(); | |
PairNumbers p1 = new PairNumbers(1,2); | |
PairNumbers p2 = new PairNumbers(3,4); | |
// Duplicate key | |
PairNumbers p3 = new PairNumbers(1,2); | |
m.put(p1, 'first'); | |
153 | |
Developer Console Enhancements Apex Code Enhancements | |
m.put(p2, 'second'); | |
m.put(p3, 'third'); | |
// Map size is 2 because the entry with | |
// the duplicate key overwrote the first entry. | |
System.assertEquals(2, m.size()); | |
// Use the == operator | |
if (p1 == p3) { | |
System.debug('p1 and p3 are equal.'); | |
} | |
// Perform some other operations | |
System.assertEquals(true, m.containsKey(p1)); | |
System.assertEquals(true, m.containsKey(p2)); | |
System.assertEquals(false, m.containsKey(new PairNumbers(5,6))); | |
for(PairNumbers pn : m.keySet()) { | |
System.debug('Key: ' + pn); | |
} | |
List<String> mValues = m.values(); | |
System.debug('m.values: ' + mValues); | |
// Create a set | |
Set<PairNumbers> s1 = new Set<PairNumbers>(); | |
s1.add(p1); | |
s1.add(p2); | |
s1.add(p3); | |
// Verify that we have only two elements | |
// since the p3 is equal to p1. | |
System.assertEquals(2, s1.size()); |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment