|
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482 |
- /*
- ==============================================================================
-
- This file is part of the Water library.
- Copyright (c) 2016 ROLI Ltd.
- Copyright (C) 2017 Filipe Coelho <falktx@falktx.com>
-
- Permission is granted to use this software under the terms of the ISC license
- http://www.isc.org/downloads/software-support-policy/isc-license/
-
- Permission to use, copy, modify, and/or distribute this software for any
- purpose with or without fee is hereby granted, provided that the above
- copyright notice and this permission notice appear in all copies.
-
- THE SOFTWARE IS PROVIDED "AS IS" AND ISC DISCLAIMS ALL WARRANTIES WITH REGARD
- TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
- FITNESS. IN NO EVENT SHALL ISC BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT,
- OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
- TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
- OF THIS SOFTWARE.
-
- ==============================================================================
- */
-
- #include "StringArray.h"
-
- namespace water {
-
- StringArray::StringArray() noexcept
- {
- }
-
- StringArray::StringArray (const StringArray& other)
- : strings (other.strings)
- {
- }
-
- #if WATER_COMPILER_SUPPORTS_MOVE_SEMANTICS
- StringArray::StringArray (StringArray&& other) noexcept
- : strings (static_cast<Array <String>&&> (other.strings))
- {
- }
- #endif
-
- StringArray::StringArray (const String& firstValue)
- {
- strings.add (firstValue);
- }
-
- StringArray::StringArray (const String* initialStrings, int numberOfStrings)
- {
- strings.addArray (initialStrings, numberOfStrings);
- }
-
- StringArray::StringArray (const char* const* initialStrings)
- {
- strings.addNullTerminatedArray (initialStrings);
- }
-
- StringArray::StringArray (const char* const* initialStrings, int numberOfStrings)
- {
- strings.addArray (initialStrings, numberOfStrings);
- }
-
- StringArray& StringArray::operator= (const StringArray& other)
- {
- strings = other.strings;
- return *this;
- }
-
- #if WATER_COMPILER_SUPPORTS_MOVE_SEMANTICS
- StringArray& StringArray::operator= (StringArray&& other) noexcept
- {
- strings = static_cast<Array<String>&&> (other.strings);
- return *this;
- }
- #endif
-
- StringArray::~StringArray()
- {
- }
-
- bool StringArray::operator== (const StringArray& other) const noexcept
- {
- return strings == other.strings;
- }
-
- bool StringArray::operator!= (const StringArray& other) const noexcept
- {
- return ! operator== (other);
- }
-
- void StringArray::swapWith (StringArray& other) noexcept
- {
- strings.swapWith (other.strings);
- }
-
- void StringArray::clear()
- {
- strings.clear();
- }
-
- void StringArray::clearQuick()
- {
- strings.clearQuick();
- }
-
- const String& StringArray::operator[] (const int index) const noexcept
- {
- if (isPositiveAndBelow (index, strings.size()))
- return strings.getReference (index);
-
- static String empty;
- return empty;
- }
-
- String& StringArray::getReference (const int index) noexcept
- {
- return strings.getReference (index);
- }
-
- bool StringArray::add (const String& newString)
- {
- return strings.add (newString);
- }
-
- #if WATER_COMPILER_SUPPORTS_MOVE_SEMANTICS
- bool StringArray::add (String&& stringToAdd)
- {
- return strings.add (static_cast<String&&> (stringToAdd));
- }
- #endif
-
- bool StringArray::insert (const int index, const String& newString)
- {
- return strings.insert (index, newString);
- }
-
- bool StringArray::addIfNotAlreadyThere (const String& newString, const bool ignoreCase)
- {
- if (contains (newString, ignoreCase))
- return false;
-
- return add (newString);
- }
-
- void StringArray::addArray (const StringArray& otherArray, int startIndex, int numElementsToAdd)
- {
- if (startIndex < 0)
- {
- wassertfalse;
- startIndex = 0;
- }
-
- if (numElementsToAdd < 0 || startIndex + numElementsToAdd > otherArray.size())
- numElementsToAdd = otherArray.size() - startIndex;
-
- while (--numElementsToAdd >= 0)
- strings.add (otherArray.strings.getReference (startIndex++));
- }
-
- void StringArray::mergeArray (const StringArray& otherArray, const bool ignoreCase)
- {
- for (int i = 0; i < otherArray.size(); ++i)
- addIfNotAlreadyThere (otherArray[i], ignoreCase);
- }
-
- void StringArray::set (const int index, const String& newString)
- {
- strings.set (index, newString);
- }
-
- bool StringArray::contains (StringRef stringToLookFor, const bool ignoreCase) const
- {
- return indexOf (stringToLookFor, ignoreCase) >= 0;
- }
-
- int StringArray::indexOf (StringRef stringToLookFor, const bool ignoreCase, int i) const
- {
- if (i < 0)
- i = 0;
-
- const int numElements = size();
-
- if (ignoreCase)
- {
- for (; i < numElements; ++i)
- if (strings.getReference(i).equalsIgnoreCase (stringToLookFor))
- return i;
- }
- else
- {
- for (; i < numElements; ++i)
- if (stringToLookFor == strings.getReference (i))
- return i;
- }
-
- return -1;
- }
-
- //==============================================================================
- void StringArray::remove (const int index)
- {
- strings.remove (index);
- }
-
- void StringArray::removeString (StringRef stringToRemove, const bool ignoreCase)
- {
- if (ignoreCase)
- {
- for (int i = size(); --i >= 0;)
- if (strings.getReference(i).equalsIgnoreCase (stringToRemove))
- strings.remove (i);
- }
- else
- {
- for (int i = size(); --i >= 0;)
- if (stringToRemove == strings.getReference (i))
- strings.remove (i);
- }
- }
-
- void StringArray::removeRange (int startIndex, int numberToRemove)
- {
- strings.removeRange (startIndex, numberToRemove);
- }
-
- //==============================================================================
- void StringArray::removeEmptyStrings (const bool removeWhitespaceStrings)
- {
- if (removeWhitespaceStrings)
- {
- for (int i = size(); --i >= 0;)
- if (! strings.getReference(i).containsNonWhitespaceChars())
- strings.remove (i);
- }
- else
- {
- for (int i = size(); --i >= 0;)
- if (strings.getReference(i).isEmpty())
- strings.remove (i);
- }
- }
-
- void StringArray::trim()
- {
- for (int i = size(); --i >= 0;)
- {
- String& s = strings.getReference(i);
- s = s.trim();
- }
- }
-
- //==============================================================================
- struct InternalStringArrayComparator_CaseSensitive
- {
- static int compareElements (String& s1, String& s2) noexcept { return s1.compare (s2); }
- };
-
- struct InternalStringArrayComparator_CaseInsensitive
- {
- static int compareElements (String& s1, String& s2) noexcept { return s1.compareIgnoreCase (s2); }
- };
-
- struct InternalStringArrayComparator_Natural
- {
- static int compareElements (String& s1, String& s2) noexcept { return s1.compareNatural (s2); }
- };
-
- void StringArray::sort (const bool ignoreCase)
- {
- if (ignoreCase)
- {
- InternalStringArrayComparator_CaseInsensitive comp;
- strings.sort (comp);
- }
- else
- {
- InternalStringArrayComparator_CaseSensitive comp;
- strings.sort (comp);
- }
- }
-
- void StringArray::sortNatural()
- {
- InternalStringArrayComparator_Natural comp;
- strings.sort (comp);
- }
-
- //==============================================================================
- String StringArray::joinIntoString (StringRef separator, int start, int numberToJoin) const
- {
- const int last = (numberToJoin < 0) ? size()
- : jmin (size(), start + numberToJoin);
-
- if (start < 0)
- start = 0;
-
- if (start >= last)
- return String();
-
- if (start == last - 1)
- return strings.getReference (start);
-
- const size_t separatorBytes = separator.text.sizeInBytes() - sizeof (String::CharPointerType::CharType);
- size_t bytesNeeded = separatorBytes * (size_t) (last - start - 1);
-
- for (int i = start; i < last; ++i)
- bytesNeeded += strings.getReference(i).getCharPointer().sizeInBytes() - sizeof (String::CharPointerType::CharType);
-
- String result;
- result.preallocateBytes (bytesNeeded);
-
- String::CharPointerType dest (result.getCharPointer());
-
- while (start < last)
- {
- const String& s = strings.getReference (start);
-
- if (! s.isEmpty())
- dest.writeAll (s.getCharPointer());
-
- if (++start < last && separatorBytes > 0)
- dest.writeAll (separator.text);
- }
-
- dest.writeNull();
-
- return result;
- }
-
- int StringArray::addTokens (StringRef text, const bool preserveQuotedStrings)
- {
- return addTokens (text, " \n\r\t", preserveQuotedStrings ? "\"" : "");
- }
-
- int StringArray::addTokens (StringRef text, StringRef breakCharacters, StringRef quoteCharacters)
- {
- int num = 0;
-
- if (text.isNotEmpty())
- {
- for (String::CharPointerType t (text.text);;)
- {
- String::CharPointerType tokenEnd (CharacterFunctions::findEndOfToken (t,
- breakCharacters.text,
- quoteCharacters.text));
- strings.add (String (t, tokenEnd));
- ++num;
-
- if (tokenEnd.isEmpty())
- break;
-
- t = ++tokenEnd;
- }
- }
-
- return num;
- }
-
- int StringArray::addLines (StringRef sourceText)
- {
- int numLines = 0;
- String::CharPointerType text (sourceText.text);
- bool finished = text.isEmpty();
-
- while (! finished)
- {
- for (String::CharPointerType startOfLine (text);;)
- {
- const String::CharPointerType endOfLine (text);
-
- switch (text.getAndAdvance())
- {
- case 0: finished = true; break;
- case '\n': break;
- case '\r': if (*text == '\n') ++text; break;
- default: continue;
- }
-
- strings.add (String (startOfLine, endOfLine));
- ++numLines;
- break;
- }
- }
-
- return numLines;
- }
-
- StringArray StringArray::fromTokens (StringRef stringToTokenise, bool preserveQuotedStrings)
- {
- StringArray s;
- s.addTokens (stringToTokenise, preserveQuotedStrings);
- return s;
- }
-
- StringArray StringArray::fromTokens (StringRef stringToTokenise,
- StringRef breakCharacters,
- StringRef quoteCharacters)
- {
- StringArray s;
- s.addTokens (stringToTokenise, breakCharacters, quoteCharacters);
- return s;
- }
-
- StringArray StringArray::fromLines (StringRef stringToBreakUp)
- {
- StringArray s;
- s.addLines (stringToBreakUp);
- return s;
- }
-
- //==============================================================================
- void StringArray::removeDuplicates (const bool ignoreCase)
- {
- for (int i = 0; i < size() - 1; ++i)
- {
- const String s (strings.getReference(i));
-
- for (int nextIndex = i + 1;;)
- {
- nextIndex = indexOf (s, ignoreCase, nextIndex);
-
- if (nextIndex < 0)
- break;
-
- strings.remove (nextIndex);
- }
- }
- }
-
- void StringArray::appendNumbersToDuplicates (const bool ignoreCase,
- const bool appendNumberToFirstInstance,
- CharPointer_UTF8 preNumberString,
- CharPointer_UTF8 postNumberString)
- {
- CharPointer_UTF8 defaultPre (" ("), defaultPost (")");
-
- if (preNumberString.getAddress() == nullptr)
- preNumberString = defaultPre;
-
- if (postNumberString.getAddress() == nullptr)
- postNumberString = defaultPost;
-
- for (int i = 0; i < size() - 1; ++i)
- {
- String& s = strings.getReference(i);
-
- int nextIndex = indexOf (s, ignoreCase, i + 1);
-
- if (nextIndex >= 0)
- {
- const String original (s);
-
- int number = 0;
-
- if (appendNumberToFirstInstance)
- s = original + String (preNumberString) + String (++number) + String (postNumberString);
- else
- ++number;
-
- while (nextIndex >= 0)
- {
- set (nextIndex, (*this)[nextIndex] + String (preNumberString) + String (++number) + String (postNumberString));
- nextIndex = indexOf (original, ignoreCase, nextIndex + 1);
- }
- }
- }
- }
-
- void StringArray::ensureStorageAllocated (int minNumElements)
- {
- strings.ensureStorageAllocated (minNumElements);
- }
-
- void StringArray::minimiseStorageOverheads()
- {
- strings.minimiseStorageOverheads();
- }
-
- }
|