alg Namespace Reference

Functions
template<typename _InputIterator , typename _Function >
void	adjacent_pairs (_InputIterator __first, _InputIterator __last, _Function __f)
	Apply a function to every sequential pair of elements of a sequence. More...
template<typename _InputIterator , typename _Function >
void	for_all_pairs (_InputIterator __first, _InputIterator __last, _Function __f)
	Apply a function to every possible pair of elements of a sequence. More...
template<class _Container , typename _Value >
bool	contains (const _Container &__container, _Value __value)
	Returns true if the container contains the given value. More...

Function Documentation

adjacent_pairs()

template<typename _InputIterator , typename _Function >

void alg::adjacent_pairs	(	_InputIterator	__first,
		_InputIterator	__last,
		_Function	__f
	)

Apply a function to every sequential pair of elements of a sequence.

Parameters

__first	An input iterator.
__last	An input iterator.
__f	A unary function object.

Applies the function object __f to each sequential pair of elements in the range [first,last). __f must not modify the order of the sequence. If __f has a return value it is ignored.

Definition at line 43 of file kicad_algo.h.

{
    if( __first != __last )
    {
        _InputIterator __follow = __first;
        ++__first;
        for( ; __first != __last; ++__first, ++__follow )
            __f( *__follow, *__first );
    }
}

contains()

template<class _Container , typename _Value >

bool alg::contains	(	const _Container &	__container,
		_Value	__value
	)

Returns true if the container contains the given value.

Definition at line 81 of file kicad_algo.h.

{
    return std::find( __container.begin(), __container.end(), __value ) != __container.end();
}

Referenced by BOARD::AddListener(), BUS_ALIAS::Contains(), PNS::ITEM_SET::Contains(), CN_CLUSTER::Contains(), PNS::LINK_HOLDER::ContainsLink(), DIALOG_SYMBOL_REMAP::createProjectSymbolLibTable(), JSON_SETTINGS::GetJson(), PANEL_SETUP_LAYERS::getNonRemovableLayers(), PANEL_SETUP_LAYERS::getRemovedLayersWithItems(), GRAPHICS_IMPORT_MGR::GRAPHICS_IMPORT_MGR(), SYMBOL_EDIT_FRAME::HardRedraw(), DIALOG_EXPORT_SVG::initDialog(), TOOL_MANAGER::isActive(), COLOR_SETTINGS::migrateSchema0to1(), BOARD_DESIGN_SETTINGS::migrateSchema0to1(), PNS::TOOL_BASE::pickSingleItem(), PCBNEW_CONTROL::placeBoardItems(), DIALOG_CHANGE_SYMBOLS::processSymbol(), PROJECT_LOCAL_SETTINGS::PROJECT_LOCAL_SETTINGS(), and SELECTION_TOOL::selectAllItemsOnSheet().

for_all_pairs()

template<typename _InputIterator , typename _Function >

void alg::for_all_pairs	(	_InputIterator	__first,
		_InputIterator	__last,
		_Function	__f
	)

Apply a function to every possible pair of elements of a sequence.

Parameters

__first	An input iterator.
__last	An input iterator.
__f	A unary function object.

Applies the function object __f to every possible pair of elements in the range [first,last). __f must not modify the order of the sequence. If __f has a return value it is ignored.

Definition at line 65 of file kicad_algo.h.

{
    if( __first != __last )
    {
        _InputIterator __follow = __first;
        ++__first;
        for( ; __first != __last; ++__first, ++__follow )
            for( _InputIterator __it = __first; __it != __last; ++__it )
                __f( *__follow, *__it );
    }
}

Referenced by SCH_EDIT_FRAME::DeleteJunction(), and SCH_EDIT_FRAME::SchematicCleanUp().