|  | | Converts a char array to a Set |  
| 
 |  
   
        
/* 
 * The contents of this file are subject to the Sapient Public License 
 * Version 1.0 (the "License"); you may not use this file except in compliance 
 * with the License. You may obtain a copy of the License at 
 * http://carbon.sf.net/License.html. 
 * 
 * Software distributed under the License is distributed on an "AS IS" basis, 
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License for 
 * the specific language governing rights and limitations under the License. 
 * 
 * The Original Code is The Carbon Component Framework. 
 * 
 * The Initial Developer of the Original Code is Sapient Corporation 
 * 
 * Copyright (C) 2003 Sapient Corporation. All Rights Reserved. 
 */ 
 
 
import java.util.ArrayList; 
import java.util.HashSet; 
import java.util.List; 
import java.util.Set; 
import java.util.StringTokenizer; 
 
/** 
 * <p>Utilities for strings.</p> 
 * 
 * 
 * Copyright 2002 Sapient 
 * @since carbon 1.0 
 * @author Greg Hinkle, May 2002 
 * @version $Revision: 1.5 $($Author: dvoet $ / $Date: 2003/05/05 21:21:24 $) 
 */ 
public class StringUtil { 
  /** 
   * <p> Converts a string to a Set. Breaks the string to characters and store 
   * each character in a Set. 
   * 
   * @param string the string to convert 
   * @return a <code>Set</code> containing all characters in the text string parameter 
   */ 
  public static Set convertToSet(String string) { 
 
      // Result hashset 
      Set resultSet = new HashSet(); 
 
      for (int i = 0; i < string.length(); i++) { 
          resultSet.add(new Character(string.charAt(i))); 
      } 
 
      // Return result 
      return resultSet; 
  } 
 
  /** 
   * <p> Converts a char array to a Set. Puts all characters in the array to a Set. 
   * 
   * @param charArray an array of <CODE>char</CODE>s 
   * @return a <code>set</code> containing all characters in the char array 
   */ 
  public static Set convertToSet(char[] charArray) { 
 
      // Result hashset 
      Set resultSet = new HashSet(); 
 
      for (int i = 0; i < charArray.length; i++) { 
          resultSet.add(new Character(charArray[i])); 
      } 
 
      // Return result 
      return resultSet; 
  } 
} 
 
    
     
     
     
     
     
     
  
  |     
 
 |  
 |  
 |  
| Related examples in the same category |  
 | 1. | Set, HashSet and TreeSet |  |  |  | 2. | Things you can do with Sets |  |   |  | 3. | Set operations: union, intersection, difference, symmetric difference, is subset, is superset |  |  |  | 4. | Set implementation that use == instead of equals() |  |  |  | 5. | Set that compares object by identity rather than equality |  |  |  | 6. | Set union and intersection |  |  |  | 7. | Set with values iterated in insertion order. |  |  |  | 8. | Putting your own type in a Set |  |   |  | 9. | Use set |  |   |  | 10. | Another Set demo |  |  |  | 11. | Set subtraction |  |   |  | 12. | Working with HashSet and TreeSet |  |   |  | 13. | TreeSet Demo |  |   |  | 14. | Show the union and intersection of two sets |  |  |  | 15. | Demonstrate the Set interface |  |  |  | 16. | Array Set extends AbstractSet |  |   |  | 17. | Sync Test  |  |  |  | 18. | Set Copy  |  |  |  | 19. | Set and TreeSet |  |  |  | 20. | Tail  |  |  |  | 21. | What you can do with a TreeSet |  |   |  | 22. | Remove all elements from a set |  |  |  | 23. | Copy all the elements from set2 to set1 (set1 += set2), set1 becomes the union of set1 and set2 |  |  |  | 24. | Remove all the elements in set1 from set2 (set1 -= set2), set1 becomes the asymmetric difference of set1 and set2 |  |  |  | 25. | Get the intersection of set1 and set2, set1 becomes the intersection of set1 and set2 |  |  |  | 26. | Extend AbstractSet to Create Simple Set |  |  |  | 27. | Int Set |  |  |  | 28. | One Item Set |  |  |  | 29. | Small sets whose elements are known to be unique by construction |  |  |  | 30. | List Set implements Set |  |  |  | 31. | Converts a string to a Set |  |  |  | 32. | Implements the Set interface, backed by a ConcurrentHashMap instance |  |  |  | 33. | An IdentitySet that uses reference-equality instead of object-equality |  |  |  | 34. | An implementation of the java.util.Stack based on an ArrayList instead of a Vector, so it is not synchronized to protect against multi-threaded access. |  |  |  | 35. | A thin wrapper around a List transforming it into a modifiable Set. |  |  |  | 36. | A thread-safe Set that manages canonical objects |  |  |  | 37. | This program uses a set to print all unique words in System.in |  |  |  | 38. | Indexed Set |  |  |  | 39. | An ObjectToSet provides a java.util.Map from arbitrary objects to objects of class java.util.Set. |  |  |  | 40. | Sorted Multi Set |  |  |  | 41. | Fixed Size Sorted Set |  |  |  | 42. | Set operations |  |  |  | 43. | A NumberedSet is a generic container of Objects where each element is identified by an integer id. |  |  |  | 44. | Set which counts the number of times a values are added to it. |  |  |  | 45. | Set which counts the number of times a values are added to it and assigns them a unique positive index. |  |  |  | 46. | Indexed Set |  |  |  | 47. | A set acts like array. |  |  |  | 48. | Implements a Bloom filter. Which, as you may not know, is a space-efficient structure for storing a set. |  |  |  | 49. | Implementation of disjoint-set data structure |  |  |  | 50. | Call it an unordered list or a multiset, this collection is defined by oxymorons |  |  |   
 |