Method empty

code/data-structures/heap.cpp:57–57

  void update_key(int n) {
    assert(loc[n] != -1), swim(loc[n]), sink(loc[n]); }
  bool empty() { return count == 0; }
  int size() { return count; }
  void clear() { count = 0, memset(loc, 255, len << 2); }};
// vim: cc=60 ts=2 sts=2 sw=2: