Umesh Krishnaswamy | 345ee99 | 2012-12-13 20:29:48 -0800 | [diff] [blame] | 1 | /** |
| 2 | * Copyright (c) 2008 The Board of Trustees of The Leland Stanford Junior |
| 3 | * University |
| 4 | * |
| 5 | * Licensed under the Apache License, Version 2.0 (the "License"); you may |
| 6 | * not use this file except in compliance with the License. You may obtain |
| 7 | * a copy of the License at |
| 8 | * |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 |
| 10 | * |
| 11 | * Unless required by applicable law or agreed to in writing, software |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT |
| 13 | * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the |
| 14 | * License for the specific language governing permissions and limitations |
| 15 | * under the License. |
| 16 | **/ |
| 17 | |
| 18 | package org.openflow.util; |
| 19 | |
| 20 | import java.util.LinkedHashMap; |
| 21 | |
| 22 | public class LRULinkedHashMap<K, V> extends LinkedHashMap<K, V> { |
| 23 | private static final long serialVersionUID = -2964986094089626647L; |
| 24 | protected int maximumCapacity; |
| 25 | |
| 26 | public LRULinkedHashMap(int initialCapacity, int maximumCapacity) { |
| 27 | super(initialCapacity, 0.75f, true); |
| 28 | this.maximumCapacity = maximumCapacity; |
| 29 | } |
| 30 | |
| 31 | public LRULinkedHashMap(int maximumCapacity) { |
| 32 | super(16, 0.75f, true); |
| 33 | this.maximumCapacity = maximumCapacity; |
| 34 | } |
| 35 | |
| 36 | @Override |
| 37 | protected boolean removeEldestEntry(java.util.Map.Entry<K, V> eldest) { |
| 38 | if (this.size() > maximumCapacity) |
| 39 | return true; |
| 40 | return false; |
| 41 | } |
| 42 | } |