array.hpp
Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2005 00008 * 00009 * Last modified: 00010 * $Date: 2010-07-14 17:46:18 +0200 (Wed, 14 Jul 2010) $ by $Author: schulte $ 00011 * $Revision: 11192 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 namespace Gecode { 00039 00040 /* 00041 * Implementation 00042 * 00043 */ 00044 00045 forceinline 00046 IntArgs::IntArgs(void) : PrimArgArray<int>(0) {} 00047 00048 forceinline 00049 IntArgs::IntArgs(int n) : PrimArgArray<int>(n) {} 00050 00051 forceinline 00052 IntArgs::IntArgs(int n, int e0, ...) : PrimArgArray<int>(n) { 00053 va_list args; 00054 va_start(args, e0); 00055 a[0] = e0; 00056 for (int i = 1; i < n; i++) 00057 a[i] = va_arg(args,int); 00058 va_end(args); 00059 } 00060 00061 forceinline 00062 IntArgs::IntArgs(const SharedArray<int>& x) 00063 : PrimArgArray<int>(x.size()) { 00064 for (int i=x.size(); i--;) 00065 a[i] = x[i]; 00066 } 00067 forceinline 00068 IntArgs::IntArgs(const std::vector<int>& x) 00069 : PrimArgArray<int>(static_cast<int>(x.size())) { 00070 for (unsigned int i=x.size(); i--;) 00071 a[i] = x[i]; 00072 } 00073 00074 forceinline 00075 IntArgs::IntArgs(int n, const int* e) : PrimArgArray<int>(n, e) {} 00076 00077 forceinline 00078 IntArgs::IntArgs(const PrimArgArray<int>& a) : PrimArgArray<int>(a) {} 00079 00080 forceinline IntArgs 00081 IntArgs::create(int n, int start, int inc) { 00082 IntArgs r(n); 00083 for (int i=0; i<n; i++, start+=inc) 00084 r[i] = start; 00085 return r; 00086 } 00087 00088 forceinline 00089 IntVarArray::IntVarArray(void) {} 00090 00091 forceinline 00092 IntVarArray::IntVarArray(Space& home, int n) 00093 : VarArray<IntVar>(home,n) {} 00094 00095 forceinline 00096 IntVarArray::IntVarArray(const IntVarArray& a) 00097 : VarArray<IntVar>(a) {} 00098 00099 forceinline 00100 IntVarArray::IntVarArray(Space& home, const IntVarArgs& a) 00101 : VarArray<IntVar>(home,a) {} 00102 00103 00104 forceinline 00105 BoolVarArray::BoolVarArray(void) {} 00106 00107 forceinline 00108 BoolVarArray::BoolVarArray(Space& home, int n) 00109 : VarArray<BoolVar>(home,n) {} 00110 00111 forceinline 00112 BoolVarArray::BoolVarArray(const BoolVarArray& a) 00113 : VarArray<BoolVar>(a) {} 00114 00115 forceinline 00116 BoolVarArray::BoolVarArray(Space& home, const BoolVarArgs& a) 00117 : VarArray<BoolVar>(home,a) {} 00118 00119 } 00120 00121 // STATISTICS: int-other