/* Theoretic - Graph Theoretic Byte Code Engineering
 * Copyright (C) 2001-2002  Jay Freeman (saurik)
*/

/*
 *        Redistribution and use in source and binary
 * forms, with or without modification, are permitted
 * provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the
 *    above copyright notice, this list of conditions
 *    and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the
 *    above copyright notice, this list of conditions
 *    and the following disclaimer in the documentation
 *    and/or other materials provided with the
 *    distribution.
 * 3. The name of the author may not be used to endorse
 *    or promote products derived from this software
 *    without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS''
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING,
 * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE
 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
 * TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#include "stdafx.h"

#include "theoretic/OpGraph.h"

namespace Theoretic {

const OpList::OperList &OpList::GetOps() const {
    return ops_;
}

OpList::OperList &OpList::GetOps() {
    return ops_;
}

Operation *OpList::operator [](size_t index) const {
    return index < ops_.size() ? ops_[index] : NULL;
}

Operation * &OpList::operator [](size_t index) {
    if (index >= ops_.size())
        ops_.resize(index+1);
    return ops_[index];
}

OpList &OpList::operator = (const OpList &list) {
    ops_ = list.ops_;
    return *this;
}

void OpList::Append(Operation *op) {
    assert(op != NULL);
    ops_.push_back(op);
}

void OpList::Append(const OpList &list) {
    const OpList::OperList &ops = list.GetOps();
    for (OpList::OperList::const_iterator op = ops.begin(); op != ops.end(); ++op)
        ops_.push_back(*op);
}

size_t OpList::Size() const {
    return ops_.size();
}

std::wostream &operator <<(std::wostream &out, const OpList &list) {
    const OpList::OperList &ops = list.GetOps();
    for (OpList::OperList::const_iterator op = ops.begin(); op != ops.end(); ++op)
        out << *op << L" ";
    return out;
}

}