![]() ![]() |
![]() |
File: [Pegasus] / pegasus / src / Pegasus / Common / ArrayInternal.h
(download)
Revision: 1.5, Sat Feb 5 22:59:23 2005 UTC (19 years, 4 months ago) by karl Branch: MAIN CVS Tags: STABLE, RELEASE_2_5_0-RC1, RELEASE_2_5_0, PEP244_ServerProfile-root, PEP244_ServerProfile-branch, PEP233_EmbeddedInstSupport-root, PEP217_PRE_BRANCH, PEP217_POST_BRANCH, PEP217_BRANCH, PEP214ROOT, PEP214BRANCH, PEP214-root, PEP214-branch, PEP-214B-root, PEGASUS_2_5_0_PerformanceDev-string-end, PEGASUS_2_5_0_PerformanceDev-rootlt, PEGASUS_2_5_0_PerformanceDev-root, PEGASUS_2_5_0_PerformanceDev-r2, PEGASUS_2_5_0_PerformanceDev-r1, PEGASUS_2_5_0_PerformanceDev-lit-end, PEGASUS_2_5_0_PerformanceDev-buffer-end, PEGASUS_2_5_0_PerformanceDev-branch, PEGASUS_2_5_0_PerformanceDev-String, PEGASUS_2_5_0_PerformanceDev-AtomicInt-branch, PEG25_IBM_5_16_05, NPEGASUS_2_5_0_PerformanceDev-String-root, NNPEGASUS_2_5_0_PerformanceDev-String-branch, BUG_4225_PERFORMANCE_VERSION_1_DONE Branch point for: PEP233_EmbeddedInstSupport-branch Changes since 1.4: +3 -1 lines BUG#: 2656 TITLE: License statement update to 2005 DESCRIPTION: All .h, .cpp and the wql, cql, compile *.l and *.y files along with the .java files in providermanager2/jmpi updated to use the license statement in doc/license.txt Tested on windows and visual test of all diffs. |
//%2005//////////////////////////////////////////////////////////////////////// // // Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development // Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems. // Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.; // IBM Corp.; EMC Corporation, The Open Group. // Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.; // IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group. // Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.; // EMC Corporation; VERITAS Software Corporation; The Open Group. // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to // deal in the Software without restriction, including without limitation the // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or // sell copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN // ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED // "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT // LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR // PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT // HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN // ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. // //============================================================================== // // Author: Roger Kumpf, Hewlett-Packard Company (roger_kumpf@hp.com) // // Modified By: Carol Ann Krug Graves, Hewlett-Packard Company // (carolann_graves@hp.com) // //%///////////////////////////////////////////////////////////////////////////// #ifndef Pegasus_ArrayInternal_h #define Pegasus_ArrayInternal_h #include <Pegasus/Common/Config.h> #include <Pegasus/Common/Array.h> #include <Pegasus/Common/CIMName.h> PEGASUS_NAMESPACE_BEGIN #include <Pegasus/Common/ArrayImpl.h> template<class PEGASUS_ARRAY_T> Boolean operator==( const Array<PEGASUS_ARRAY_T>& x, const Array<PEGASUS_ARRAY_T>& y) { if (x.size() != y.size()) return false; for (Uint32 i = 0, n = x.size(); i < n; i++) { if (!(x[i] == y[i])) return false; } return true; } template<class PEGASUS_ARRAY_T> Boolean Contains(const Array<PEGASUS_ARRAY_T>& a, const PEGASUS_ARRAY_T& x) { Uint32 n = a.size(); for (Uint32 i = 0; i < n; i++) { if (a[i] == x) return true; } return false; } template<class PEGASUS_ARRAY_T> void BubbleSort(Array<PEGASUS_ARRAY_T>& x) { Uint32 n = x.size(); if (n < 2) return; for (Uint32 i = 0; i < n - 1; i++) { for (Uint32 j = 0; j < n - 1; j++) { if (x[j] > x[j+1]) { PEGASUS_ARRAY_T t = x[j]; x[j] = x[j+1]; x[j+1] = t; } } } } inline void BubbleSort(Array<CIMName>& x) { Uint32 n = x.size(); if (n < 2) return; for (Uint32 i = 0; i < n - 1; i++) { for (Uint32 j = 0; j < n - 1; j++) { if (x[j].getString() > x[j+1].getString()) { CIMName t = x[j]; x[j] = x[j+1]; x[j+1] = t; } } } } inline void BubbleSort(Array<CIMNamespaceName>& x) { Uint32 n = x.size(); if (n < 2) return; for (Uint32 i = 0; i < n - 1; i++) { for (Uint32 j = 0; j < n - 1; j++) { if (x[j].getString() > x[j+1].getString()) { CIMNamespaceName t = x[j]; x[j] = x[j+1]; x[j+1] = t; } } } } #if 0 // Determine need for these functions template<class PEGASUS_ARRAY_T> void Unique(Array<PEGASUS_ARRAY_T>& x) { Array<PEGASUS_ARRAY_T> result; for (Uint32 i = 0, n = x.size(); i < n; i++) { if (i == 0 || x[i] != x[i-1]) result.append(x[i]); } x.swap(result); } template<class PEGASUS_ARRAY_T> void Print(Array<PEGASUS_ARRAY_T>& x) { for (Uint32 i = 0, n = x.size(); i < n; i++) PEGASUS_STD(cout) << x[i] << PEGASUS_STD(endl); } #endif PEGASUS_NAMESPACE_END #endif /* Pegasus_ArrayInternal_h */
No CVS admin address has been configured |
Powered by ViewCVS 0.9.2 |