subset.h

// Percy++ Copyright 2007,2012,2013,2014
// Ian Goldberg <iang@cs.uwaterloo.ca>,
// Casey Devet <cjdevet@uwaterloo.ca>,
// Ryan Henry <rhenry@cs.uwaterloo.ca>
// 
// This program is free software; you can redistribute it and/or modify
// it under the terms of version 2 of the GNU General Public License as
// published by the Free Software Foundation.
// 
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.
// 
// There is a copy of the GNU General Public License in the COPYING file
// packaged with this plugin; if you cannot find it, write to the Free
// Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
// 02110-1301 USA

#ifndef __SUBSET_H__
#define __SUBSET_H__

// Operations on subsets of the set of servers.  These subsets are
// stored as sorted vectors of nservers_t.

#include <vector>
#include "percytypes.h"

using namespace std;

// Append k random elements of G[offset..end] to I
void random_subset(const vector<nservers_t> &G,
    vector<nservers_t> &I, nservers_t k, nservers_t offset = 0);

// Compute the intersection of the two *strictly sorted* vectors v1 and v2
vector<nservers_t> intersect(const vector<nservers_t> &v1,
    const vector<nservers_t> &v2);

#endif