src/datastructure/simplequeue.hpp

• View this file on GitHub
• Last update: 2020-07-12 20:41:58+09:00
• Include: #include "src/datastructure/simplequeue.hpp"

Required by

• src/graph/balancedseparator.hpp
• src/graph/bimaching.hpp
• src/graph/treedecomp.hpp

Verified with

• src/bimaching.test.cpp
• src/treedecomp_width2.test.cpp

Code

#pragma once

template <class T> struct SimpleQueue {
    V<T> payload;
    size_t pos = 0;
    void reserve(size_t size) { payload.reserve(size); }
    size_t size() const { return payload.size() - pos; }
    bool empty() const { return pos == payload.size(); }
    void push(const T& t) { payload.push_back(t); }
    T& front() {
        assert(!empty());
        return payload[pos];
    }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() {
        assert(!empty());
        pos++;
    }
};

#line 2 "src/datastructure/simplequeue.hpp"

template <class T> struct SimpleQueue {
    V<T> payload;
    size_t pos = 0;
    void reserve(size_t size) { payload.reserve(size); }
    size_t size() const { return payload.size() - pos; }
    bool empty() const { return pos == payload.size(); }
    void push(const T& t) { payload.push_back(t); }
    T& front() {
        assert(!empty());
        return payload[pos];
    }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() {
        assert(!empty());
        pos++;
    }
};

Back to top page