michael@0: // Copyright (c) 2007, Google Inc.
michael@0: // All rights reserved.
michael@0: //
michael@0: // Redistribution and use in source and binary forms, with or without
michael@0: // modification, are permitted provided that the following conditions are
michael@0: // met:
michael@0: //
michael@0: //     * Redistributions of source code must retain the above copyright
michael@0: // notice, this list of conditions and the following disclaimer.
michael@0: //     * Redistributions in binary form must reproduce the above
michael@0: // copyright notice, this list of conditions and the following disclaimer
michael@0: // in the documentation and/or other materials provided with the
michael@0: // distribution.
michael@0: //     * Neither the name of Google Inc. nor the names of its
michael@0: // contributors may be used to endorse or promote products derived from
michael@0: // this software without specific prior written permission.
michael@0: //
michael@0: // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
michael@0: // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
michael@0: // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
michael@0: // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
michael@0: // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
michael@0: // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
michael@0: // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
michael@0: // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
michael@0: // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
michael@0: // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
michael@0: // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
michael@0: //
michael@0: //  SimpleStringDictionary.mm
michael@0: //  Simple string dictionary that does not allocate memory
michael@0: //
michael@0: 
michael@0: #include <assert.h>
michael@0: 
michael@0: #import "SimpleStringDictionary.h"
michael@0: 
michael@0: namespace google_breakpad {
michael@0: 
michael@0: //==============================================================================
michael@0: const KeyValueEntry *SimpleStringDictionary::GetEntry(int i) const {
michael@0:   return (i >= 0 && i < MAX_NUM_ENTRIES) ? &entries_[i] : NULL;
michael@0: }
michael@0: 
michael@0: //==============================================================================
michael@0: int SimpleStringDictionary::GetCount() const {
michael@0:   int count = 0;
michael@0:   for (int i = 0; i < MAX_NUM_ENTRIES; ++i) {
michael@0:     if (entries_[i].IsActive() ) {
michael@0:       ++count;
michael@0:     }
michael@0:   }
michael@0:   
michael@0:   return count;
michael@0: }
michael@0: 
michael@0: //==============================================================================
michael@0: const char *SimpleStringDictionary::GetValueForKey(const char *key) const {
michael@0:   assert(key);
michael@0:   if (!key)
michael@0:     return NULL;
michael@0: 
michael@0:   for (int i = 0; i < MAX_NUM_ENTRIES; ++i) {
michael@0:     const KeyValueEntry &entry = entries_[i];
michael@0:     if (entry.IsActive() && !strcmp(entry.GetKey(), key)) {
michael@0:       return entry.GetValue();
michael@0:     }
michael@0:   }
michael@0: 
michael@0:   return NULL;
michael@0: }
michael@0: 
michael@0: //==============================================================================
michael@0: void SimpleStringDictionary::SetKeyValue(const char *key,
michael@0:                                          const char *value) {
michael@0:   if (!value) {
michael@0:     RemoveKey(key);
michael@0:     return;
michael@0:   }
michael@0: 
michael@0:   // key must not be NULL
michael@0:   assert(key);
michael@0:   if (!key)
michael@0:     return;
michael@0:   
michael@0:   // key must not be empty string
michael@0:   assert(key[0] != '\0');
michael@0:   if (key[0] == '\0')
michael@0:     return;
michael@0:   
michael@0:   int free_index = -1;
michael@0:   
michael@0:   // check if key already exists
michael@0:   for (int i = 0; i < MAX_NUM_ENTRIES; ++i) {
michael@0:     KeyValueEntry &entry = entries_[i];
michael@0:     
michael@0:     if (entry.IsActive()) {
michael@0:       if (!strcmp(entry.GetKey(), key)) {
michael@0:         entry.SetValue(value);
michael@0:         return;
michael@0:       }
michael@0:     } else {
michael@0:       // Make a note of an empty slot
michael@0:       if (free_index == -1) {
michael@0:         free_index = i;
michael@0:       }
michael@0:     }
michael@0:   }
michael@0:   
michael@0:   // check if we've run out of space
michael@0:   assert(free_index != -1);
michael@0:   
michael@0:   // Put new key into an empty slot (if found)
michael@0:   if (free_index != -1) {
michael@0:     entries_[free_index].SetKeyValue(key, value);
michael@0:   }
michael@0: }
michael@0: 
michael@0: //==============================================================================
michael@0: void SimpleStringDictionary::RemoveKey(const char *key) {
michael@0:   assert(key);
michael@0:   if (!key)
michael@0:     return;
michael@0: 
michael@0:   for (int i = 0; i < MAX_NUM_ENTRIES; ++i) {
michael@0:     if (!strcmp(entries_[i].GetKey(), key)) {
michael@0:       entries_[i].Clear();
michael@0:       return;
michael@0:     }
michael@0:   }
michael@0: }
michael@0: 
michael@0: }  // namespace google_breakpad