 |
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
|
LINE Solver (C++)
Templated C++ port of the LINE queueing solver
|
This is the complete list of members for line::qn::Network< T >, including all inherited members.
| add_cache(const std::string &nm, const CacheParam< T > &par) | line::qn::Network< T > | inline |
| add_class_switch(const std::string &nm, const Matrix< T > &C) | line::qn::Network< T > | inline |
| add_class_switch(const std::string &nm) | line::qn::Network< T > | inline |
| add_closed_class(const std::string &nm, double njobs, std::size_t refstat_node, int prio=0) | line::qn::Network< T > | inline |
| add_delay(const std::string &nm) | line::qn::Network< T > | inline |
| add_fork(const std::string &nm, double tasks_per_link=1.0) | line::qn::Network< T > | inline |
| add_join(const std::string &nm, std::size_t fork_node) | line::qn::Network< T > | inline |
| add_join_unbound(const std::string &nm) | line::qn::Network< T > | inline |
| add_logger(const std::string &nm, const std::string &log_file=std::string()) | line::qn::Network< T > | inline |
| add_open_class(const std::string &nm, int prio=0) | line::qn::Network< T > | inline |
| add_place(const std::string &nm) | line::qn::Network< T > | inline |
| add_queue(const std::string &nm, SchedStrategy sched=SchedStrategy::FCFS) | line::qn::Network< T > | inline |
| add_region(const std::vector< std::size_t > &nodes, const std::vector< double > &class_max_jobs, double global_max_jobs=-1.0, const std::vector< DropStrategy > &rule=std::vector< DropStrategy >(), const std::vector< double > &class_max_memory=std::vector< double >(), const std::vector< T > &class_size=std::vector< T >(), double global_max_memory=-1.0, const std::string &name=std::string()) | line::qn::Network< T > | inline |
| add_router(const std::string &nm) | line::qn::Network< T > | inline |
| add_self_looping_class(const std::string &nm, double njobs, std::size_t refstat_node, int prio=0) | line::qn::Network< T > | inline |
| add_server_type(std::size_t node, const typename Station< T >::ServerType &stype) | line::qn::Network< T > | inline |
| add_sink(const std::string &nm) | line::qn::Network< T > | inline |
| add_source(const std::string &nm) | line::qn::Network< T > | inline |
| add_transition(const std::string &nm, const TransitionParam< T > &par) | line::qn::Network< T > | inline |
| bind_join(std::size_t join_node, std::size_t fork_node) | line::qn::Network< T > | inline |
| get_struct() | line::qn::Network< T > | inline |
| init_routing_matrix() const | line::qn::Network< T > | inline |
| link(const RoutingMatrix< T > &Pm) | line::qn::Network< T > | inline |
| Network(const std::string &nm) | line::qn::Network< T > | inlineexplicit |
| pas_mirror(std::size_t ist, const std::function< T(const std::vector< std::size_t > &)> &mu, const Matrix< T > &swap_graph) | line::qn::Network< T > | inline |
| raw_struct() | line::qn::Network< T > | inline |
| set_arrival(std::size_t node, std::size_t cls, const Distrib< T > &d) | line::qn::Network< T > | inline |
| set_arrival_batch(std::size_t node, std::size_t cls, const Distrib< T > &dist) | line::qn::Network< T > | inline |
| set_balking(std::size_t node, std::size_t cls, lang::BalkingStrategy strategy, const std::vector< typename Station< T >::BalkingThreshold > &thresholds) | line::qn::Network< T > | inline |
| set_batch_reject(std::size_t node, std::size_t cls, const T &p) | line::qn::Network< T > | inline |
| set_breakdown(std::size_t node, const Distrib< T > &failure, const Distrib< T > &repair, const std::vector< Distrib< T > > &down_service=std::vector< Distrib< T > >()) | line::qn::Network< T > | inline |
| set_capacity(std::size_t node, double k) | line::qn::Network< T > | inline |
| set_class_capacity(std::size_t node, std::size_t cls, double k) | line::qn::Network< T > | inline |
| set_class_deadline(std::size_t cls, double due) | line::qn::Network< T > | inline |
| set_class_dependence(std::size_t node, const CdScaling< T > &fun, const std::vector< T > &peak=std::vector< T >()) | line::qn::Network< T > | inline |
| set_class_immediate_feedback(std::size_t cls) | line::qn::Network< T > | inline |
| set_class_patience(std::size_t cls, const Distrib< T > &dist, lang::ImpatienceType kind=lang::ImpatienceType::RENEGING) | line::qn::Network< T > | inline |
| set_class_spawn(std::size_t cls, std::size_t spawn_cls) | line::qn::Network< T > | inline |
| set_class_switch_matrix(std::size_t node, const Matrix< T > &C) | line::qn::Network< T > | inline |
| set_departure_discipline(std::size_t node, std::size_t cls, lang::DepartureDiscipline rule) | line::qn::Network< T > | inline |
| set_drop_rule(std::size_t node, std::size_t cls, DropStrategy rule) | line::qn::Network< T > | inline |
| set_fork_branch_probability(std::size_t fork_node, std::size_t jobclass, std::size_t dest_node, double prob) | line::qn::Network< T > | inline |
| set_fork_tasks_per_link(std::size_t fork_node, std::size_t jobclass, double tasks, std::size_t dest_node=0) | line::qn::Network< T > | inline |
| set_fork_tasks_per_link_dist(std::size_t fork_node, std::size_t jobclass, const lang::Distrib< T > &dist, std::size_t dest_node=0) | line::qn::Network< T > | inline |
| set_global_dependence(const GdScaling< T > &fun, const std::vector< T > &peak) | line::qn::Network< T > | inline |
| set_global_dependence(const GdScaling< T > &fun, const std::vector< T > &peak, int wire_cutoff) | line::qn::Network< T > | inline |
| set_hetero_sched_policy(std::size_t node, lang::HeteroSchedPolicy policy) | line::qn::Network< T > | inline |
| set_immediate_feedback(std::size_t node, std::size_t cls) | line::qn::Network< T > | inline |
| set_initial_marking(std::size_t node, const std::vector< T > &tokens) | line::qn::Network< T > | inline |
| set_item_miss_class(std::size_t cache_node, const std::vector< std::size_t > &miss_classes) | line::qn::Network< T > | inline |
| set_item_read_classes(std::size_t cache_node, const std::vector< std::size_t > &read_classes, const std::vector< std::size_t > &hit_classes) | line::qn::Network< T > | inline |
| set_join_strategy(std::size_t node, lang::JoinStrategy strategy, double quorum=0.0) | line::qn::Network< T > | inline |
| set_joint_dependence(std::size_t node, const CdScaling< T > &fun, const std::vector< T > &peak) | line::qn::Network< T > | inline |
| set_load_dependence(std::size_t node, const std::vector< T > &alpha) | line::qn::Network< T > | inline |
| set_log_path(const std::string &path) | line::qn::Network< T > | inline |
| set_marked_classes(std::size_t node, const std::vector< std::size_t > &classes) | line::qn::Network< T > | inline |
| set_miss_cache(std::size_t cache_node, std::size_t next_cache, const std::vector< std::size_t > &hit_classes_at_next) | line::qn::Network< T > | inline |
| set_number_of_servers(std::size_t node, double n) | line::qn::Network< T > | inline |
| set_orbit_impatience(std::size_t node, std::size_t cls, const Distrib< T > &dist) | line::qn::Network< T > | inline |
| set_pas(std::size_t node, const std::function< T(const std::vector< std::size_t > &)> &mu, const std::vector< std::vector< bool > > &swap_graph=std::vector< std::vector< bool > >()) | line::qn::Network< T > | inline |
| set_patience(std::size_t node, std::size_t cls, const Distrib< T > &dist, lang::ImpatienceType kind=lang::ImpatienceType::RENEGING) | line::qn::Network< T > | inline |
| set_polling(std::size_t node, lang::PollingType ptype, const std::vector< Distrib< T > > &switchover=std::vector< Distrib< T > >(), std::size_t pk=1) | line::qn::Network< T > | inline |
| set_polling_type(std::size_t node, lang::PollingType rule, int par=0) | line::qn::Network< T > | inline |
| set_reference_class(std::size_t cls) | line::qn::Network< T > | inline |
| set_region_constraint(std::size_t region, const Matrix< T > &A, const std::vector< T > &b) | line::qn::Network< T > | inline |
| set_region_weights(std::size_t region, const std::vector< T > &weight) | line::qn::Network< T > | inline |
| set_reply_signal_class(std::size_t call_cls, std::size_t reply_cls) | line::qn::Network< T > | inline |
| set_retrial(std::size_t node, std::size_t cls, const Distrib< T > &proc, const T &rate, int max_attempts=0) | line::qn::Network< T > | inline |
| set_retrieval_system(std::size_t cache_node, std::size_t read_class, std::size_t miss_class, const std::vector< std::size_t > &queue_nodes) | line::qn::Network< T > | inline |
| set_reward(const std::string &nm, const std::function< T(const std::vector< T > &)> &fn, const std::string &kind=std::string(), std::size_t node=0, std::size_t cls=0) | line::qn::Network< T > | inline |
| set_routing(std::size_t node, std::size_t cls, RoutingStrategy rs) | line::qn::Network< T > | inline |
| set_routing_param(std::size_t node, std::size_t cls, int d) | line::qn::Network< T > | inline |
| set_routing_weights(std::size_t node, std::size_t cls, const std::map< std::size_t, double > &weights) | line::qn::Network< T > | inline |
| set_sched_param(std::size_t node, std::size_t cls, const T &weight) | line::qn::Network< T > | inline |
| set_server_parallelism(std::size_t node, std::size_t cls, std::size_t n) | line::qn::Network< T > | inline |
| set_service(std::size_t node, std::size_t cls, const Distrib< T > &d) | line::qn::Network< T > | inline |
| set_service_rate_function(std::size_t node, const std::function< T(const std::vector< std::size_t > &)> &muFun, const Matrix< T > &swap_graph=Matrix< T >()) | line::qn::Network< T > | inline |
| set_setup_delayoff(std::size_t node, std::size_t cls, const Distrib< T > &setup, const Distrib< T > &delayoff) | line::qn::Network< T > | inline |
| set_signal(std::size_t cls, lang::SignalType type, lang::RemovalPolicy policy=lang::RemovalPolicy::RANDOM, std::size_t target=0, const std::vector< T > &remdist=std::vector< T >()) | line::qn::Network< T > | inline |
| set_state_dep_routing(std::size_t entry, std::size_t departure, const std::vector< std::vector< std::size_t > > &branches, const std::vector< std::size_t > &level, const std::vector< double > &C, const Matrix< double > &d, std::size_t cls=0) | line::qn::Network< T > | inline |
| set_state_prior(std::size_t node, const Matrix< T > &space, const std::vector< T > &prior) | line::qn::Network< T > | inline |
| set_switchover(std::size_t node, std::size_t cls, const Distrib< T > &so) | line::qn::Network< T > | inline |
| set_sync_reply(std::size_t node, std::size_t call_cls, std::size_t reply_cls) | line::qn::Network< T > | inline |
| station_index(std::size_t node) const | line::qn::Network< T > | inline |
1.18.0