1 /* 2 * [The "BSD licence"] 3 * Copyright (c) 2005-2008 Terence Parr 4 * All rights reserved. 5 * 6 * Conversion to C#: 7 * Copyright (c) 2008 Sam Harwell, Pixel Mine, Inc. 8 * All rights reserved. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. The name of the author may not be used to endorse or promote products 19 * derived from this software without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 22 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 24 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 25 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 26 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 27 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 28 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 29 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 30 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 31 */ 32 33 using System; 34 using System.Collections.Generic; 35 #if DEBUG 36 using System.Linq; 37 #endif 38 39 namespace Antlr.Runtime.JavaExtensions 40 { 41 public static class SetExtensions 42 { 43 #if DEBUG 44 [Obsolete] add( this HashSet<T> set, T item )45 public static bool add<T>( this HashSet<T> set, T item ) 46 { 47 return set.Add( item ); 48 } 49 #endif 50 addAll( this HashSet<T> set, IEnumerable<T> items )51 public static void addAll<T>( this HashSet<T> set, IEnumerable<T> items ) 52 { 53 foreach ( T item in items ) 54 set.Add( item ); 55 } 56 57 #if DEBUG 58 [Obsolete] clear( this HashSet<T> set )59 public static void clear<T>( this HashSet<T> set ) 60 { 61 set.Clear(); 62 } 63 64 [Obsolete] contains( this HashSet<T> set, T value )65 public static bool contains<T>( this HashSet<T> set, T value ) 66 { 67 return set.Contains( value ); 68 } 69 70 [Obsolete] remove( this HashSet<T> set, T item )71 public static bool remove<T>( this HashSet<T> set, T item ) 72 { 73 return set.Remove( item ); 74 } 75 76 [Obsolete] size( this HashSet<T> set )77 public static int size<T>( this HashSet<T> set ) 78 { 79 return set.Count; 80 } 81 82 [Obsolete] toArray( this HashSet<T> set )83 public static T[] toArray<T>( this HashSet<T> set ) 84 { 85 return set.ToArray(); 86 } 87 #endif 88 } 89 } 90