utils/FastQueue.cpp

• View this file on GitHub
• Last update: 2023-02-27 10:03:35-03:00

Depends on

• bits/stdc++.h

Required by

• matroid/MatroidIntersection.cpp
• matroid/v2/MatroidIntersection.cpp

Code

#ifndef _LIB_FAST_QUEUE
#define _LIB_FAST_QUEUE
#include <bits/stdc++.h>

namespace lib {
  using namespace std;
template<typename T>
struct FastQueue {
  vector<T> v;
  int L = 0, R = 0;
  FastQueue(int cap) : v(cap) {}

  void push(const T& no) {
    if(R >= v.size()) v.emplace_back();
    v[R++] = no;
  }
  T& front() {
    return v[L];
  }
  T front() const {
    return v[L];
  }
  T pop() {
    return v[L++];
  }
  bool empty() const {
    return L >= R;
  }
  int size() const {
    return max(R - L, 0);
  }
  void clear() {
    L = 0, R = 0;
  }
};
} // namespace lib

#endif

#line 1 "utils/FastQueue.cpp"


#include <bits/stdc++.h>

namespace lib {
  using namespace std;
template<typename T>
struct FastQueue {
  vector<T> v;
  int L = 0, R = 0;
  FastQueue(int cap) : v(cap) {}

  void push(const T& no) {
    if(R >= v.size()) v.emplace_back();
    v[R++] = no;
  }
  T& front() {
    return v[L];
  }
  T front() const {
    return v[L];
  }
  T pop() {
    return v[L++];
  }
  bool empty() const {
    return L >= R;
  }
  int size() const {
    return max(R - L, 0);
  }
  void clear() {
    L = 0, R = 0;
  }
};
} // namespace lib

Back to top page