2011-07-16 18:00:20 +04:00
|
|
|
/*
|
|
|
|
* Copyright 2011, Haiku, Inc. All Rights Reserved.
|
|
|
|
* Distributed under the terms of the MIT License.
|
|
|
|
*/
|
|
|
|
#ifndef _SUPPORT_BSTRING_LIST_H_
|
|
|
|
#define _SUPPORT_BSTRING_LIST_H_
|
|
|
|
|
|
|
|
|
|
|
|
#include <BeBuild.h>
|
2011-12-15 10:34:45 +04:00
|
|
|
#include <Flattenable.h>
|
2011-07-16 18:00:20 +04:00
|
|
|
#include <List.h>
|
|
|
|
#include <String.h>
|
|
|
|
|
|
|
|
|
2011-12-15 10:34:45 +04:00
|
|
|
class BStringList : public BFlattenable {
|
2011-07-16 18:00:20 +04:00
|
|
|
public:
|
|
|
|
BStringList(int32 count = 20);
|
|
|
|
BStringList(const BStringList& other);
|
|
|
|
virtual ~BStringList();
|
|
|
|
|
|
|
|
// Adding and removing items.
|
|
|
|
bool Add(const BString& string, int32 index);
|
|
|
|
bool Add(const BString& string);
|
|
|
|
bool Add(const BStringList& list, int32 index);
|
|
|
|
bool Add(const BStringList& list);
|
|
|
|
|
|
|
|
bool Remove(const BString& string,
|
|
|
|
bool ignoreCase = false);
|
2011-12-17 05:21:35 +04:00
|
|
|
bool Remove(const BStringList& list,
|
2011-12-15 10:34:45 +04:00
|
|
|
bool ignoreCase = false);
|
2011-07-16 18:00:20 +04:00
|
|
|
BString Remove(int32 index);
|
|
|
|
bool Remove(int32 index, int32 count);
|
|
|
|
bool Replace(int32 index, const BString& string);
|
|
|
|
|
|
|
|
void MakeEmpty();
|
|
|
|
|
|
|
|
// Reorder items
|
|
|
|
void Sort(bool ignoreCase = false);
|
|
|
|
// TODO: Sort() with custom sort function.
|
|
|
|
bool Swap(int32 indexA, int32 indexB);
|
|
|
|
bool Move(int32 fromIndex, int32 toIndex);
|
|
|
|
|
|
|
|
// Retrieve items
|
|
|
|
BString StringAt(int32 index) const;
|
|
|
|
BString First() const;
|
|
|
|
BString Last() const;
|
|
|
|
|
|
|
|
// Query
|
|
|
|
bool HasString(const BString& string,
|
|
|
|
bool ignoreCase = false) const;
|
|
|
|
int32 IndexOf(const BString& string,
|
|
|
|
bool ignoreCase = false) const;
|
|
|
|
int32 CountStrings() const;
|
|
|
|
bool IsEmpty() const;
|
|
|
|
|
2013-05-24 05:08:16 +04:00
|
|
|
BString Join(const char* separator, int32 length = -1)
|
|
|
|
const;
|
2013-04-29 21:32:23 +04:00
|
|
|
|
2011-07-16 18:00:20 +04:00
|
|
|
// Iteration
|
|
|
|
void DoForEach(bool (*func)(const BString& string));
|
|
|
|
void DoForEach(bool (*func)(const BString& string,
|
|
|
|
void* arg2), void* arg2);
|
|
|
|
|
|
|
|
BStringList& operator=(const BStringList& other);
|
|
|
|
bool operator==(const BStringList& other) const;
|
|
|
|
bool operator!=(const BStringList& other) const;
|
|
|
|
|
2011-12-15 10:34:45 +04:00
|
|
|
// BFlattenable
|
|
|
|
virtual bool IsFixedSize() const;
|
|
|
|
virtual type_code TypeCode() const;
|
|
|
|
virtual bool AllowsTypeCode(type_code code) const;
|
|
|
|
virtual ssize_t FlattenedSize() const;
|
|
|
|
virtual status_t Flatten(void* buffer, ssize_t size) const;
|
|
|
|
virtual status_t Unflatten(type_code code, const void* buffer,
|
|
|
|
ssize_t size);
|
|
|
|
|
2011-07-16 18:00:20 +04:00
|
|
|
private:
|
|
|
|
void _IncrementRefCounts() const;
|
|
|
|
void _DecrementRefCounts() const;
|
|
|
|
|
2013-05-24 05:08:16 +04:00
|
|
|
BString _Join(const char* separator, int32 length)
|
|
|
|
const;
|
2013-04-29 21:32:23 +04:00
|
|
|
|
2011-07-16 18:00:20 +04:00
|
|
|
private:
|
|
|
|
BList fStrings;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
inline bool
|
|
|
|
BStringList::HasString(const BString& string, bool ignoreCase) const
|
|
|
|
{
|
|
|
|
return IndexOf(string, ignoreCase) >= 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
inline bool
|
|
|
|
BStringList::operator!=(const BStringList& other) const
|
|
|
|
{
|
|
|
|
return !(*this == other);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
#endif // _SUPPORT_BSTRING_LIST_H_
|