Zoltan 2 Version 0.5
GidLookupHelper.cpp
Go to the documentation of this file.
00001 // @HEADER
00002 //
00003 // ***********************************************************************
00004 //
00005 //   Zoltan2: A package of combinatorial algorithms for scientific computing
00006 //                  Copyright 2012 Sandia Corporation
00007 //
00008 // Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
00009 // the U.S. Government retains certain rights in this software.
00010 //
00011 // Redistribution and use in source and binary forms, with or without
00012 // modification, are permitted provided that the following conditions are
00013 // met:
00014 //
00015 // 1. Redistributions of source code must retain the above copyright
00016 // notice, this list of conditions and the following disclaimer.
00017 //
00018 // 2. Redistributions in binary form must reproduce the above copyright
00019 // notice, this list of conditions and the following disclaimer in the
00020 // documentation and/or other materials provided with the distribution.
00021 //
00022 // 3. Neither the name of the Corporation nor the names of the
00023 // contributors may be used to endorse or promote products derived from
00024 // this software without specific prior written permission.
00025 //
00026 // THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
00027 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00028 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
00029 // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
00030 // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
00031 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
00032 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
00033 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
00034 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
00035 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
00036 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00037 //
00038 // Questions? Contact Karen Devine      (kddevin@sandia.gov)
00039 //                    Erik Boman        (egboman@sandia.gov)
00040 //                    Siva Rajamanickam (srajama@sandia.gov)
00041 //
00042 // ***********************************************************************
00043 //
00044 // @HEADER
00045 // @HEADER
00046 // ***********************************************************************
00047 //         Zoltan2: Sandia Partitioning Ordering & Coloring Library
00048 // ***********************************************************************
00049 // @HEADER
00050 //
00051 // Test the GidLookupHelper class.
00052 
00053 #include <Zoltan2_GidLookupHelper.hpp>
00054 
00055 using namespace std;
00056 using Teuchos::RCP;
00057 using Teuchos::rcp;
00058 using Teuchos::ArrayRCP;
00059 using Teuchos::Comm;
00060 
00061 int main(int argc, char *argv[])
00062 {
00063   Teuchos::GlobalMPISession session(&argc, &argv);
00064   RCP<const Comm<int> > comm = Teuchos::DefaultComm<int>::getComm();
00065   int rank = comm->getRank();
00066   RCP<const Zoltan2::Environment> env = rcp(new Zoltan2::Environment);
00067   ArrayRCP<int> idx;
00068 
00069   if (rank == 0){
00070     int *buf = new int [10];
00071     for (int i=0; i < 10; i++)
00072       buf[i] = (i+1)*10;
00073 
00074     // ten distinct gids
00075     cout << endl << "10 distinct int gids" << endl;
00076     ArrayRCP<const int> intGids = Teuchos::arcp(buf, 0, 10, true);
00077     Zoltan2::GidLookupHelper<int, int> glhInt(env, intGids);
00078     cout << "Lookup:" << endl;
00079     for (int i=0; i < 10; i++){
00080       cout << "Gid: " << buf[i] << " idx: " << glhInt.lookup(buf[i]) << endl;
00081     }
00082 
00083     // ten gids with duplicates
00084     cout << endl << "10 int gids with duplicates" << endl;
00085     for (int i=0; i < 5; i++) 
00086       buf[i] = buf[i+5] = i;
00087     Zoltan2::GidLookupHelper<int, int> glhIntDup(env, intGids);
00088     cout << "Lookup:" << endl;
00089     for (int i=0; i < 10; i++){
00090       cout << "Gid: " << buf[i] << " idx: " << glhIntDup.lookup(buf[i]) << endl;
00091     }
00092 
00093     // string gids
00094     cout << endl << "4 string gids" << endl;
00095     string *sbuf = new string [4];
00096     sbuf[0] = string("gid number 0");
00097     sbuf[1] = string("gid number 1");
00098     sbuf[2] = string("gid number 2");
00099     sbuf[3] = string("gid number 3");
00100     ArrayRCP<const string> sGids = Teuchos::arcp(sbuf, 0, 4, true);
00101     Zoltan2::GidLookupHelper<string, int> glhString(env, sGids);
00102     cout << "Lookup:" << endl;
00103     for (int i=0; i < 4; i++){
00104       cout << "Gid: " << sbuf[i] << " idx: " << glhString.lookup(sbuf[i]) << endl;
00105     }
00106     
00107     // string gids with duplicates
00108     cout << endl << "4 string gids with a duplicate" << endl;
00109     sbuf[3] = string("gid number 0");
00110     Zoltan2::GidLookupHelper<string, int> glhStringDup(env, sGids);
00111     cout << "Lookup:" << endl;
00112     for (int i=0; i < 4; i++){
00113       cout << "Gid: " << sbuf[i] << " idx: " << glhStringDup.lookup(sbuf[i]) << endl;
00114     }
00115 
00116     cout << "PASS" << endl;
00117   }
00118 }