/*

 * Copyright (c) 2015, 2017, Oracle and/or its affiliates. All rights reserved.

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 */

#ifndef SHARE_GC_Z_ZLIST_INLINE_HPP

#define SHARE_GC_Z_ZLIST_INLINE_HPP

#include "gc/z/zList.hpp"

template <typename T, bool forward>

ZListIteratorImpl<T, forward>::ZListIteratorImpl(const ZList<T>* list) :

    _list(list),

    _next(forward ? list->first() : list->last()) {}

template <typename T, bool forward>

bool ZListIteratorImpl<T, forward>::next(T** elem) {

  if (_next != NULL) {

    *elem = _next;

    _next = forward ? _list->next(_next) : _list->prev(_next);

    return true;

  }

  // No more elements

  return false;

}

#endif // SHARE_GC_Z_ZLIST_INLINE_HPP