joque
task orchestration library
joque::bits Namespace Reference

MIT License. More...

Classes

struct  lheader_accessor
 
struct  lrheader_accessor
 
class  gedge
 
class  gnode
 
class  graph
 
struct  list_header
 
class  list_iterator
 
class  list
 
class  list_ptr
 

Functions

template<typename Accessor , typename Node >
void list_unlink (Node &node)
 
template<typename Ptr , typename... Args>
auto & list_emplace_next (Ptr ptr, Args &&... args)
 
template<typename Ptr , typename Node >
void list_link_next (Ptr ptr, Node &next)
 
template<typename Header >
void list_delete_all_next (Header &header)
 

Variables

template<typename T , typename Node >
concept header_accessor
 Header accessor is a type that has static member function get(n) which returns reference to list header stored in node n. More...
 

Detailed Description

MIT License.

Copyright (c) 2025 Jan Veverak Koniarik

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

Function Documentation

◆ list_unlink()

template<typename Accessor , typename Node >
void joque::bits::list_unlink ( Node &  node)

◆ list_emplace_next()

template<typename Ptr , typename... Args>
auto & joque::bits::list_emplace_next ( Ptr  ptr,
Args &&...  args 
)

References list_link_next().

◆ list_link_next()

template<typename Ptr , typename Node >
void joque::bits::list_link_next ( Ptr  ptr,
Node &  next 
)

◆ list_delete_all_next()

template<typename Header >
void joque::bits::list_delete_all_next ( Header &  header)

Variable Documentation

◆ header_accessor

template<typename T , typename Node >
concept joque::bits::header_accessor
Initial value:
= requires( Node& n, const Node& cn ) {
{ T::get( n ) } -> std::convertible_to< list_header< Node, T >& >;
{ T::get( cn ) } -> std::convertible_to< const list_header< Node, T >& >;
}
requires(std::same_as< std::remove_cvref_t< T >, task_set >) void for_each_task(T &ts
Recursively executes function f for each task in set ts.

Header accessor is a type that has static member function get(n) which returns reference to list header stored in node n.

Function should exist for n being const or non-const.