/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ /* vim:set ts=2 sw=2 sts=2 et cindent: */ /* ***** BEGIN LICENSE BLOCK ***** * Version: MPL 1.1/GPL 2.0/LGPL 2.1 * * The contents of this file are subject to the Mozilla Public License Version * 1.1 (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * http://www.mozilla.org/MPL/ * * 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 C++ array template tests. * * The Initial Developer of the Original Code is Google Inc. * Portions created by the Initial Developer are Copyright (C) 2005 * the Initial Developer. All Rights Reserved. * * Contributor(s): * Darin Fisher * * Alternatively, the contents of this file may be used under the terms of * either the GNU General Public License Version 2 or later (the "GPL"), or * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * * ***** END LICENSE BLOCK ***** */ #include #include #include "nsTArray.h" #include "nsMemory.h" #include "nsAutoPtr.h" #include "nsString.h" #include "nsDirectoryServiceDefs.h" #include "nsDirectoryServiceUtils.h" #include "nsComponentManagerUtils.h" #include "nsXPCOM.h" #include "nsILocalFile.h" // Define this so we can use test_basic_array in test_comptr_array template inline bool operator<(const nsCOMPtr& lhs, const nsCOMPtr& rhs) { return lhs.get() < rhs.get(); } //---- template static PRBool test_basic_array(ElementType *data, PRUint32 dataLen, const ElementType& extra) { nsTArray ary; ary.AppendElements(data, dataLen); PRUint32 i; for (i = 0; i < ary.Length(); ++i) { if (ary[i] != data[i]) return PR_FALSE; } // ensure sort results in ascending order ary.Sort(); for (i = 1; i < ary.Length(); ++i) { if (ary[i] < ary[i-1]) return PR_FALSE; } PRUint32 oldLen = ary.Length(); ary.RemoveElement(data[dataLen / 2]); if (ary.Length() != (oldLen - 1)) return PR_FALSE; PRUint32 index = ary.Length() / 2; if (!ary.InsertElementAt(index, extra)) return PR_FALSE; if (ary[index] != extra) return PR_FALSE; if (ary.IndexOf(extra) == PR_UINT32_MAX) return PR_FALSE; if (ary.LastIndexOf(extra) == PR_UINT32_MAX) return PR_FALSE; // ensure proper searching if (ary.IndexOf(extra) > ary.LastIndexOf(extra)) return PR_FALSE; if (ary.IndexOf(extra, index) != ary.LastIndexOf(extra, index)) return PR_FALSE; nsTArray copy(ary); for (i = 0; i < copy.Length(); ++i) { if (ary[i] != copy[i]) return PR_FALSE; } if (!ary.AppendElements(copy)) return PR_FALSE; PRUint32 cap = ary.Capacity(); ary.RemoveElementsAt(copy.Length(), copy.Length()); ary.Compact(); if (ary.Capacity() == cap) return PR_FALSE; ary.Clear(); if (!ary.IsEmpty() || ary.Elements() != nsnull) return PR_FALSE; ary = copy; for (i = 0; i < copy.Length(); ++i) { if (ary[i] != copy[i]) return PR_FALSE; } return PR_TRUE; } static PRBool test_int_array() { int data[] = {4,6,8,2,4,1,5,7,3}; return test_basic_array(data, NS_ARRAY_LENGTH(data), int(14)); } static PRBool test_int64_array() { PRInt64 data[] = {4,6,8,2,4,1,5,7,3}; return test_basic_array(data, NS_ARRAY_LENGTH(data), PRInt64(14)); } static PRBool test_char_array() { char data[] = {4,6,8,2,4,1,5,7,3}; return test_basic_array(data, NS_ARRAY_LENGTH(data), char(14)); } static PRBool test_uint32_array() { PRUint32 data[] = {4,6,8,2,4,1,5,7,3}; return test_basic_array(data, NS_ARRAY_LENGTH(data), PRUint32(14)); } //---- class Object { public: Object() : mNum(0) { } Object(const char *str, PRUint32 num) : mStr(str), mNum(num) { } Object(const Object& other) : mStr(other.mStr), mNum(other.mNum) { } ~Object() {} Object& operator=(const Object& other) { mStr = other.mStr; mNum = other.mNum; return *this; } PRBool operator==(const Object& other) const { return mStr == other.mStr && mNum == other.mNum; } PRBool operator<(const Object& other) const { // sort based on mStr only return Compare(mStr, other.mStr) < 0; } const char *Str() const { return mStr.get(); } PRUint32 Num() const { return mNum; } private: nsCString mStr; PRUint32 mNum; }; static PRBool test_object_array() { nsTArray objArray; const char kdata[] = "hello world"; PRUint32 i; for (i = 0; i < NS_ARRAY_LENGTH(kdata); ++i) { char x[] = {kdata[i],'\0'}; if (!objArray.AppendElement(Object(x, i))) return PR_FALSE; } for (i = 0; i < NS_ARRAY_LENGTH(kdata); ++i) { if (objArray[i].Str()[0] != kdata[i]) return PR_FALSE; if (objArray[i].Num() != i) return PR_FALSE; } objArray.Sort(); const char ksorted[] = "\0 dehllloorw"; for (i = 0; i < NS_ARRAY_LENGTH(kdata)-1; ++i) { if (objArray[i].Str()[0] != ksorted[i]) return PR_FALSE; } return PR_TRUE; } // nsTArray> is not supported #if 0 static PRBool test_autoptr_array() { nsTArray< nsAutoPtr > objArray; const char kdata[] = "hello world"; for (PRUint32 i = 0; i < NS_ARRAY_LENGTH(kdata); ++i) { char x[] = {kdata[i],'\0'}; nsAutoPtr obj(new Object(x,i)); if (!objArray.AppendElement(obj)) // XXX does not call copy-constructor for nsAutoPtr!!! return PR_FALSE; if (obj.get() == nsnull) return PR_FALSE; obj.forget(); // the array now owns the reference } for (PRUint32 i = 0; i < NS_ARRAY_LENGTH(kdata); ++i) { if (objArray[i]->Str()[0] != kdata[i]) return PR_FALSE; if (objArray[i]->Num() != i) return PR_FALSE; } return PR_TRUE; } #endif //---- static PRBool test_string_array() { nsTArray strArray; const char kdata[] = "hello world"; PRUint32 i; for (i = 0; i < NS_ARRAY_LENGTH(kdata); ++i) { if (!strArray.AppendElement(nsCString(kdata[i]))) return PR_FALSE; } for (i = 0; i < NS_ARRAY_LENGTH(kdata); ++i) { if (strArray[i].CharAt(0) != kdata[i]) return PR_FALSE; } strArray.Sort(); const char ksorted[] = "\0 dehllloorw"; for (i = 0; i < NS_ARRAY_LENGTH(kdata)-1; ++i) { if (strArray[i].CharAt(0) != ksorted[i]) return PR_FALSE; } nsCString rawArray[NS_ARRAY_LENGTH(kdata)-1]; for (i = 0; i < NS_ARRAY_LENGTH(rawArray); ++i) rawArray[i].Assign(kdata + i); // substrings of kdata return test_basic_array(rawArray, NS_ARRAY_LENGTH(rawArray), nsCString("foopy")); } //---- static PRBool test_comptr_array() { typedef nsCOMPtr FilePointer; FilePointer tmpDir; NS_GetSpecialDirectory(NS_OS_TEMP_DIR, getter_AddRefs(tmpDir)); if (!tmpDir) return PR_FALSE; const char *kNames[] = { "foo.txt", "bar.html", "baz.gif" }; nsTArray fileArray; PRUint32 i; for (i = 0; i < NS_ARRAY_LENGTH(kNames); ++i) { FilePointer f; tmpDir->Clone(getter_AddRefs(f)); if (!f) return PR_FALSE; if (NS_FAILED(f->AppendNative(nsDependentCString(kNames[i])))) return PR_FALSE; fileArray.AppendElement(f); } // It's unclear what 'operator<' means for nsCOMPtr, but whatever... return test_basic_array(fileArray.Elements(), fileArray.Length(), tmpDir); } //---- typedef PRBool (*TestFunc)(); #define DECL_TEST(name) { #name, name } static const struct Test { const char* name; TestFunc func; } tests[] = { DECL_TEST(test_int_array), DECL_TEST(test_int64_array), DECL_TEST(test_char_array), DECL_TEST(test_uint32_array), DECL_TEST(test_object_array), DECL_TEST(test_string_array), DECL_TEST(test_comptr_array), { nsnull, nsnull } }; int main(int argc, char **argv) { int count = 1; if (argc > 1) count = atoi(argv[1]); if (NS_FAILED(NS_InitXPCOM2(nsnull, nsnull, nsnull))) return -1; while (count--) { for (const Test* t = tests; t->name != nsnull; ++t) { printf("%25s : %s\n", t->name, t->func() ? "SUCCESS" : "FAILURE"); } } NS_ShutdownXPCOM(nsnull); return 0; }