adjacent_left_node_iterator.h

/*****************************************************************************
 * VCLib                                                                     *
 * Visual Computing Library                                                  *
 *                                                                           *
 * Copyright(C) 2021-2025                                                    *
 * Visual Computing Lab                                                      *
 * ISTI - Italian National Research Council                                  *
 *                                                                           *
 * All rights reserved.                                                      *
 *                                                                           *
 * This program is free software; you can redistribute it and/or modify      *
 * it under the terms of the Mozilla Public License Version 2.0 as published *
 * by the Mozilla Foundation; either version 2 of the License, or            *
 * (at your option) any later version.                                       *
 *                                                                           *
 * This program 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              *
 * Mozilla Public License Version 2.0                                        *
 * (https://www.mozilla.org/en-US/MPL/2.0/) for more details.                *
 ****************************************************************************/
 
#ifndef VCL_SPACE_COMPLEX_GRAPH_BIPARTITE_ITERATORS_ADJACENT_LEFT_NODE_ITERATOR_H
#define VCL_SPACE_COMPLEX_GRAPH_BIPARTITE_ITERATORS_ADJACENT_LEFT_NODE_ITERATOR_H
 
#include "adjacent_node_iterator.h"
 
namespace vcl::detail {
 
template<typename Graph, typename Iterator>
class AdjacentLeftNodeIterator : public AdjacentNodeIterator<Graph, Iterator>
{
    using Base = AdjacentNodeIterator<Graph, Iterator>;
 
public:
    using value_type = Graph::RightType;
    using reference  = const value_type&;
    using pointer    = const value_type*;
 
    using AdjacentNodeIterator<Graph, Iterator>::AdjacentNodeIterator;
 
    reference operator*() const
    {
        return Base::mGraph->mNodesR[*(Base::mIt)].info();
    }
 
    pointer operator->() const
    {
        return &Base::mGraph->mNodesR[*(Base::mIt)].info();
    }
};
 
} // namespace vcl::detail
 
#endif // VCL_SPACE_COMPLEX_GRAPH_BIPARTITE_ITERATORS_ADJACENT_LEFT_NODE_ITERATOR_H