include/e6nlaq/internal/queue.hpp

• View this file on GitHub
• Last update: 2025-12-12 17:20:18+09:00
• Include: #include "include/e6nlaq/internal/queue.hpp"

Required by

• include/e6nlaq/all.hpp
• include/e6nlaq/maxflow.hpp

Code

#pragma once

// This file is a fork of AtCoder Library.

#define E6NLAQ_INTERNAL_QUEUE_HPP

#include <vector>

namespace e6nlaq {

namespace internal {

template <class T>
struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

}  // namespace internal

}  // namespace e6nlaq

#line 2 "include/e6nlaq/internal/queue.hpp"

// This file is a fork of AtCoder Library.

#define E6NLAQ_INTERNAL_QUEUE_HPP

#include <vector>

namespace e6nlaq {

namespace internal {

template <class T>
struct simple_queue {
    std::vector<T> payload;
    int pos = 0;
    void reserve(int n) { payload.reserve(n); }
    int size() const { return int(payload.size()) - pos; }
    bool empty() const { return pos == int(payload.size()); }
    void push(const T& t) { payload.push_back(t); }
    T& front() { return payload[pos]; }
    void clear() {
        payload.clear();
        pos = 0;
    }
    void pop() { pos++; }
};

}  // namespace internal

}  // namespace e6nlaq

Back to top page