X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Futil%2FIntPairMap.java;h=706e54b0fdda8d9b5d8282fcac929ed0d7958b58;hb=d334d5060dbaa23f8f94b60cf1238c3f47cb5e9f;hp=db12004df84e65305c8de0816454aa3ee714601f;hpb=a22c5074e705e3ffcf03e9f9d174aed8ef79fc91;p=sbp.git

diff --git a/src/edu/berkeley/sbp/util/IntPairMap.java b/src/edu/berkeley/sbp/util/IntPairMap.java
index db12004..706e54b 100644
--- a/src/edu/berkeley/sbp/util/IntPairMap.java
+++ b/src/edu/berkeley/sbp/util/IntPairMap.java
@@ -1,9 +1,11 @@
+// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+
 package edu.berkeley.sbp.util;
 import java.util.*;
 
 // FEATURE: make this faster (plenty of ways: quadradic probing hash table is one)
 /** a sparse mapping from pairs of <tt>int</tt>'s to <tt>V</tt>'s */
-public final class IntPairMap<V> {
+public final class IntPairMap<V> implements Iterable<V> {
 
     private final HashMap<Long, V> hm = new HashMap<Long, V>();
 
@@ -16,4 +18,5 @@ public final class IntPairMap<V> {
     public Iterable<V> values() { return hm.values(); }
     public int size() { return hm.size(); }
     public void toArray(V[] v) { hm.values().toArray(v); }
+    public Iterator<V> iterator() { return hm.values().iterator(); }
 }