clanguml::sequence_diagram::model Namespace Reference

Classes
class	activity
	Model of a sequence diagram activity. More...
struct	class_
	Sequence diagram participant representing a class. More...
class	diagram
	Model of a sequence diagram. More...
struct	function
	Participant mode representing a free function. More...
struct	function_template
	Participant model representing a function template. More...
class	message
	Model of a sequence diagram message. More...
struct	method
	Participant model representing a method. More...
struct	objc_method
struct	participant
	Base class for various types of sequence diagram participants. More...
struct	reverse_call_graph_activity_node

Typedefs
using	message_chain_t = std::vector< sequence_diagram::model::message >

Functions
void	to_json (nlohmann::json &j, const participant &c)
void	to_json (nlohmann::json &j, const activity &c)
std::vector< std::vector< eid_t > >	find_reverse_message_chains (const reverse_call_graph_activity_node &root)
	Convert reverse call graph into a list of activity id chains.
bool	operator== (const class_ &l, const class_ &r)

Typedef Documentation

message_chain_t

using clanguml::sequence_diagram::model::message_chain_t = typedef std::vector<sequence_diagram::model::message>

Definition at line 31 of file diagram.h.

Function Documentation

find_reverse_message_chains()

std::vector< std::vector< eid_t > > clanguml::sequence_diagram::model::find_reverse_message_chains

(

const reverse_call_graph_activity_node &

root

)

Convert reverse call graph into a list of activity id chains.

Parameters

root	Root of the reverse call graph tree

Returns

Definition at line 30 of file diagram.cc.

{
    std::vector<std::vector<eid_t>> all_message_chains;
    std::vector<eid_t> current_chain;
 
    // Depth first search lambda function to traverse reverse call graph
    std::function<void(const reverse_call_graph_activity_node &)> dfs =
        [&](const reverse_call_graph_activity_node &node) {
            // Add the current node’s activity ID to the path
            current_chain.push_back(node.activity_id);
 
            if (node.callers.empty()) {
                auto reversed = current_chain;
                std::reverse(reversed.begin(), reversed.end());
                all_message_chains.emplace_back(std::move(reversed));
            }
            else {
                for (const auto &child : node.callers) {
                    dfs(child);
                }
            }
 
            // Backtrack
            current_chain.pop_back();
        };
 
    // Start depth first search
    dfs(root);
 
    return all_message_chains;
}

operator==()

bool clanguml::sequence_diagram::model::operator==	(	const class_ &	l,
		const class_ &	r
	)

Definition at line 113 of file participant.cc.

{ return l.id() == r.id(); }

to_json() [1/2]

void clanguml::sequence_diagram::model::to_json	(	nlohmann::json &	j,
		const activity &	c
	)

Definition at line 50 of file sequence_diagram_generator.cc.

{
    j["participant_id"] = std::to_string(c.from().value());
}

to_json() [2/2]

void clanguml::sequence_diagram::model::to_json	(	nlohmann::json &	j,
		const participant &	c
	)

Definition at line 25 of file sequence_diagram_generator.cc.

{
    to_json(j, dynamic_cast<const participant::element &>(c));
    j["type"] = c.type_name();
 
    if (c.type_name() == "method") {
        j["name"] = dynamic_cast<const method &>(c).method_name();
    }
    else if (c.type_name() == "objc_method") {
        j["name"] = dynamic_cast<const objc_method &>(c).method_name();
    }
 
    j["full_name"] = display_name_adapter(c).full_name(false);
 
    if (c.type_name() == "function" || c.type_name() == "function_template") {
        const auto &f = dynamic_cast<const function &>(c);
        if (f.is_cuda_kernel())
            j["is_cuda_kernel"] = true;
        if (f.is_cuda_device())
            j["is_cuda_device"] = true;
        if (f.is_coroutine())
            j["is_coroutine"] = true;
    }
}