xpcom/ds/nsCheapSets.cpp

   1 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
   2 /* ***** BEGIN LICENSE BLOCK *****
   3  * Version: MPL 1.1/GPL 2.0/LGPL 2.1
   4  *
   5  * The contents of this file are subject to the Mozilla Public License Version
   6  * 1.1 (the "License"); you may not use this file except in compliance with
   7  * the License. You may obtain a copy of the License at
   8  * http://www.mozilla.org/MPL/
   9  *
  10  * Software distributed under the License is distributed on an "AS IS" basis,
  11  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
  12  * for the specific language governing rights and limitations under the
  13  * License.
  14  *
  15  * The Original Code is Mozilla Communicator client code.
  16  *
  17  * The Initial Developer of the Original Code is
  18  * Netscape Communications Corporation.
  19  * Portions created by the Initial Developer are Copyright (C) 1998
  20  * the Initial Developer. All Rights Reserved.
  21  *
  22  * Contributor(s):
  23  *
  24  * Alternatively, the contents of this file may be used under the terms of
  25  * either of the GNU General Public License Version 2 or later (the "GPL"),
  26  * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
  27  * in which case the provisions of the GPL or the LGPL are applicable instead
  28  * of those above. If you wish to allow use of your version of this file only
  29  * under the terms of either the GPL or the LGPL, and not to allow others to
  30  * use your version of this file under the terms of the MPL, indicate your
  31  * decision by deleting the provisions above and replace them with the notice
  32  * and other provisions required by the GPL or the LGPL. If you do not delete
  33  * the provisions above, a recipient may use your version of this file under
  34  * the terms of any one of the MPL, the GPL or the LGPL.
  35  *
  36  * ***** END LICENSE BLOCK ***** */
  37
  38 #include "nsCheapSets.h"
  39
  40 nsCheapStringSet::~nsCheapStringSet()
  41 {
  42   nsStringHashSet* set = GetHash();
  43   if (set) {
  44     delete set;
  45   } else {
  46     delete GetStr();
  47   }
  48 }
  49
  50 /**
  51  * Put a string into the table
  52  */
  53 nsresult
  54 nsCheapStringSet::Put(const nsAString& aVal)
  55 {
  56   // Add the value to the hash if it is there
  57   nsStringHashSet* set = GetHash();
  58   if (set) {
  59     return set->Put(aVal);
  60   }
  61
  62   // If a string is already there, create a hashtable and both of these to it
  63   if (GetStr()) {
  64     nsAString* oldStr = GetStr();
  65     nsresult rv = InitHash(&set);
  66     NS_ENSURE_SUCCESS(rv, rv);
  67
  68     rv = set->Put(*oldStr);
  69     delete oldStr;
  70     NS_ENSURE_SUCCESS(rv, rv);
  71
  72     return set->Put(aVal);
  73   }
  74
  75   // Nothing exists in the hash right now, so just set the single string
  76   return SetStr(aVal);
  77 }
  78
  79 void
  80 nsCheapStringSet::Remove(const nsAString& aVal)
  81 {
  82   // Remove from the hash if the hash is there
  83   nsStringHashSet* set = GetHash();
  84   if (set) {
  85     set->Remove(aVal);
  86     return;
  87   }
  88
  89   // Remove the string if there is just a string
  90   nsAString* str = GetStr();
  91   if (str && str->Equals(aVal)) {
  92     delete str;
  93     mValOrHash = nsnull;
  94   }
  95 }
  96
  97 nsresult
  98 nsCheapStringSet::InitHash(nsStringHashSet** aSet)
  99 {
 100   nsStringHashSet* newSet = new nsStringHashSet();
 101   if (!newSet) {
 102     return NS_ERROR_OUT_OF_MEMORY;
 103   }
 104
 105   nsresult rv = newSet->Init(10);
 106   NS_ENSURE_SUCCESS(rv, rv);
 107
 108   mValOrHash = newSet;
 109   *aSet = newSet;
 110   return NS_OK;
 111 }
 112
 113
 114 nsCheapInt32Set::~nsCheapInt32Set()
 115 {
 116   delete GetHash();
 117 }
 118
 119 nsresult
 120 nsCheapInt32Set::Put(PRInt32 aVal)
 121 {
 122   // Add the value to the hash or set the pointer as an int
 123   nsInt32HashSet* set = GetHash();
 124   if (set) {
 125     return set->Put(aVal);
 126   }
 127
 128   // Create the hash and add the value to it if there is an int already
 129   if (IsInt()) {
 130     PRInt32 oldInt = GetInt();
 131
 132     nsresult rv = InitHash(&set);
 133     NS_ENSURE_SUCCESS(rv, rv);
 134
 135     rv = set->Put(oldInt);
 136     NS_ENSURE_SUCCESS(rv, rv);
 137
 138     return set->Put(aVal);
 139   }
 140
 141   // Create the hash anyway if the int is negative (negative numbers cannot
 142   // fit into our PtrBits abstraction)
 143   if (aVal < 0) {
 144     nsresult rv = InitHash(&set);
 145     NS_ENSURE_SUCCESS(rv, rv);
 146
 147     return set->Put(aVal);
 148   }
 149
 150   // Finally, just set the int if we can't do anything with hashes
 151   SetInt(aVal);
 152   return NS_OK;
 153 }
 154
 155 void
 156 nsCheapInt32Set::Remove(PRInt32 aVal)
 157 {
 158   nsInt32HashSet* set = GetHash();
 159   if (set) {
 160     set->Remove(aVal);
 161   } else if (IsInt() && GetInt() == aVal) {
 162     mValOrHash = nsnull;
 163   }
 164 }
 165
 166 nsresult
 167 nsCheapInt32Set::InitHash(nsInt32HashSet** aSet)
 168 {
 169   nsInt32HashSet* newSet = new nsInt32HashSet();
 170   if (!newSet) {
 171     return NS_ERROR_OUT_OF_MEMORY;
 172   }
 173
 174   nsresult rv = newSet->Init(10);
 175   NS_ENSURE_SUCCESS(rv, rv);
 176
 177   mValOrHash = newSet;
 178   *aSet = newSet;
 179   return NS_OK;
 180 }