Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 12345]

►Ndaisi
►Ncpps
►Namr
CAmrStaticAbility
CAmrStaticAbilityHasher
CLoadCarrier
►Ncommon
CCppsCommunicator	Aggregation object holding communication related members
►Nlogical	Modified Round Robin Algorithm that centrally assigns tasks of incoming material flows to the corresponding centralized participants
CAlgorithmConfig
CAlgorithmInterface
CAmrLogicalAgent
CAmrLogicalExecutionState
CAssignmentInitiator	Algorithm for assigning tasks from a material flow to fitting AMRs. This algorithm is initiating and coordinating the procedure. There always must be a corresponding derived class from AssignmentParticipant
CAssignmentNotification	Notification by a central initiator that a task has been assigned to the receiving participant
CAssignmentParticipant	Algorithm for assigning tasks from a material flow to fitting AMRs. This algorithm is participating in the procedure which is beeing coordinated by an initiator. There always must be a corresponding derived class from AssignmentInitiator
CAssignmentResponse	Response of a central participant as a reaction of a task assignment. Consists of the task_uuid, the acception / rejection, its connection string and of the new current status
►CAuctionBasedTaskManagement
CInsertionPoint
►CAuctionInitiatorState	Helper class for the IteratedAuctionAssignmentInitiator to handle and store the state of received bids and winner responses
CWinner	Helper struct to store information needed to send WinnerNotifications
CAuctionParticipantState	Helper struct for the IteratedAuctionAssignmentParticipant to store the state of open auction processes, calculated bids (metrics) and insertion points. Each AuctionParticipantState is only responsible for one auction process by one dedicated initiator
CAuctionParticipantTaskState	Helper struct for the IteratedAuctionAssignmentParticipant, used inside of the AuctionParticipantState, to store information related to exactly one task. This includes the previously calculated bids (metrics) and insertion points
CBidSubmission
CCallForProposal
►CCentralizedInitiator	Algorithm that centrally assigns tasks of incoming material flows to the corresponding centralized participants. Should be implemented by any concrete centralized task assignment algorithm
CParticipantInfo	Helper that stores all relevant information about the task assignment participants. If more specific information are necessary, use a struct that derives from ParticipantInfo
CCentralizedParticipant	Participant of a centralized task assignment strategy. Since the task assignment strategy is defined by the central allocator, the participant only needs to handle new task assignments
CIteratedAuctionAssignmentInitiator	The initiator class for auction-based assignment, based on the TePSSI algorithm from Nunes, E., McIntire, M., & Gini, M. (2017). Decentralized multi-robot allocation of tasks with temporal and precedence constraints. Advanced Robotics, 31(22), 1193-1207
CIteratedAuctionAssignmentParticipant	This class is the counterpart of the IteratedAuctionAssignmentInitiator, particpanting in the iterated auction procedure. It must be able to process, IterationNotification, and WinnerNotification messages
CIterationNotification
CLayeredPrecedenceGraph	Helper class to implement the pIA algorithm. A directed graph is layered into a free, second, and hidden layer. Prioritization is neglected in this modification of the algorithm. Therefore, all tasks from the free layer are automatically auctionable
CLogicalAgent
CLPCVertex
CMaterialFlowLogicalAgent
CMaterialFlowStateLogger
CMaterialFlowUpdate
CMetrics
CMetricsComposition
CRoundRobinInitiator
CSimpleTaskManagement
CStatusUpdate	Might need some revision / additions in the future
CStatusUpdateRequest	Might need some revision / additions in the future
►CStnTaskManagement
CStnInsertionPoint
CTaskInsertInfo	Task, the end locations, and metrics compositions for the single orders
CStnTaskManagementEdge
CStnTaskManagementVertex
CTaskManagement
CTaskManagementHelper
CWinnerNotification
CWinnerResponse
CAGVPhysicalBasic
CAlgorithmScenario
►CAmrAssetConnector
CAmrAssetConnectorImpl
CAmrDescription
CAmrDescriptionScenario
CAmrFleet
CAmrKinematics
CAmrKinematicsScenario
CAmrLoadHandlingScenario
CAmrLoadHandlingUnit
CAmrLoggingInfo
CAmrLogicalAgentApplication	Wrapper to run an AMR Logical Agent as a ns3::Application
CAmrMobilityHelper
CAmrMobilityModelNs3
CAmrMobilityStatus
CAmrOrder
CAmrOrderInfo
CAmrOrderUpdate
CAmrPhysicalAsset	Manages communication with the corresponding logical agent and execution of transport orders
CAmrPhysicalAssetApplication	Wrapper to run an AMR Physical Asset as a ns3::Application
CAmrPhysicalProperties
CAmrPositionLoggingInfo
CAmrProperties
CAmrPropertiesScenario
CAmrStatusUpdate
CChargedBattery
CCppsLoggerNs3
CCppsManager
CCppsScenariofile
CCppsTCPMessage
CExecutedOrderUtilityLoggingInfo
CFieldMessageCpps
CLoad
CLoadedPayload
CMaterialFlowDescriptionScenario
CMaterialFlowLogicalAgentApplication	Wrapper to run a Material Flow Logical Agent as a ns3::Application
CMoveTo
CNavigate
CNegotiationTrafficLoggingInfo
CReachedTarget
CReceivedOrder
CSpawnDistributionScenario
CSpawnInfoScenario
CTopology
CTopologyScenario
CUnload
CUnloadedPayload
►Ndatastructure
CDirectedGraph
CSimpleTemporalNetwork
CWeightedDirectedGraph
►Nmaterial_flow
CActionOrder
CActionOrderStep
CLocation
CMFDLScheduler
CMoveOrder
CMoveOrderStep
CTask
CTimeWindow
CTransportOrder
CTransportOrderStep
►Nminhton_ns3
CAbsolute
CAlgorithms
CChoice
CChoiceValue
CConstant
CConstantTime
CContentBehavior
CDepth
CFailMany
CFailOne
CFindQuery
CFrequency
CGaussian
CJoinMany
CJoinOne
CLeaveMany
CLeaveOne
CMinhtonApplication	Wrapper to run MINHTON as a ns-3 application
►CMinhtonManager
CScheduler
CMinhtonScenariofile
CMinhtonScenarioSequenceStep
CMixedExecution
CNodes
CPeerDiscoveryAttribute
CPeerDiscoveryEnvironment
CPresenceBehavior
CRandomNode
CRequestCountdown
CRequests
CSearchAll
CSearchMany
CStatic
CStaticBuild
CStaticTime
CStaticUpdate
CTime
CTimeouts
CUniform
CUpdateBehavior
CValidateLeave
CValidityThreshold
►Nnatter_ns3
CJoin
CNatterApplication	Wrapper to run natter as a ns-3 application. Only MINHCAST is supported at the moment!
CNatterManager
CNatterScenariofile
CNatterScenarioSequenceStep
CPublish
►Nnetwork_tcp
CClient
CClientCallbacks
CEndpoint
CFramingManager
CServer
CServerCallbacks
►Npath_planning
►Nconsensus
CAcceptedProposal
CAcceptMessage
CCentralParticipant	Participant/Client in the centralized client-server occupancy management
CCentralServer
CCentralSettings
CConsensus
CConsensusBase	CRTP base class for a consensus algorithm
COKMessage	< OK message from all acceptors to all other participants to commit the requested occupancy
CPaxosAcceptor	Implementation for an acceptor in the paxos consensus algorithm
CPaxosConsensus
CPaxosContainer
CPaxosProposer	Implementation for an proposer in the paxos consensus algorithm
CPaxosReplicationManager
CPaxosSettings
CPrepareMessage
CPromiseMessage
CReplicationMessage
CRequest	Request message from a pickup station to the central server
CResponse	Response to a request from central server to pickup station
CResponseMessage
CRouteCalculationHelper
►Nmessage
CDriveMessage	Message that is send from PickupStation to logical AGV with drive instructions
CDriveMessageField	Message send from AGVLogical to AGVPhysicalBasic with a 2D coordinate
CHandoverMessage
CNewAuthorityAGV
CPositionUpdate	Update of the actual AGV position send from AGVPhysicalBasic to AGVLogical
CReachedGoal
CReachedGoalField
CAGVInfo	Static and dynamic AGV information that a station needs to know
CAGVLogical
CAGVQueue	Single-point parking queue with unlimited space
CCalcVars
CDeliveryStation
CDeliveryStationInfo
CDestinationHash
CIntersectionTimeInfo
CPathPlanningApplication
CPathPlanningLoggerNs3
CPathPlanningManager	Manager that sets up and runs the path planning use case
CPickupStation
CPickupStationHandoverInfo	Information for a pickup station about other pickup stations
CPickupStationInfo
CRoute
CRouteIdentifier	Identifier of a route from a station and point type to another station with given point type
CTask
CTransportOrderInfo
►Nsola_ns3
CDelay
CPublish
CSolaApplication
CSolaLoggerNs3
CSolaManager	Basic manager to test SOLA features standalone within simulation
CSolaScenariofile
CSolaScenarioSequenceStep
CStartSOLA
CSubscribeTopic
►Nsolanet_ns3
CSolaMessageNs3
►Nutil
CPose
CCoreNetwork	Network structure with one central L3 router, forming a star topology
CDist
CGeneralScenariofile
CLoggerInfoTestSetup
CLoggerManager
CManager
CSocketManager
CSQLiteHelper
►Nminhton
►Ncore
CEvent
►CWatchDog
CImpl
►Nserializer
CSerializerCereal
CAccessContainer
CAlgorithmException
CAlgorithmInterface
CAlgorithmTypesContainer
CAndExpression
CAtomicBooleanExpression
CBooleanExpression
CBootstrapAlgorithmGeneral
CBootstrapAlgorithmInterface
CConfigNode
CConnectionInfo
CDistributedData
CDSNHandler
CEmptyExpression
CEntitySearchAlgorithmInterface
CFindQuery
CFindQueryParser
CFiniteStateMachine
CFSMException
CFuzzyValue
CInvalidMessageException
CISerializer
CJoinAlgorithmGeneral
CJoinAlgorithmInterface
CJoinInfo
CLeaveAlgorithmGeneral
CLeaveAlgorithmInterface
CLocalData
CLogger
CLoggerInfoAddContent
CLoggerInfoAddEvent
CLoggerInfoAddFindQuery
CLoggerInfoAddFindQueryResult
CLoggerInfoAddNeighbor
CLoggerInfoAddNode
CLoggerInfoNodeState
CLoggerInfoSearchExact
CLoggerInterface
CLoggerPhysicalNodeInfo
CLogicalNodeInfo
CLogicalNodeInfoHasher
CLogicContainer
CMessageAttributeInquiryAnswer	Usage: The message that the node which received a MessageAttributeInquiryRequest sends back
CMessageAttributeInquiryRequest	Usage: A node that is not a DSN may receive a MessageAttributeInquiryRequest during an ongoing Entity Search. A MessageAttributeInquiryRequest always comes from a DSN, which can also be the requesting node itself
CMessageBootstrapDiscover	Usage: A node wants to join the network but does not have access to a node's network information to send the initial Join message to. Therefore a MessageBootstrapDiscover gets send through a Multicast to discover a node's network information
CMessageBootstrapResponse	Usage: After receiving a MessageBootstrapDiscover, the node receiving the message might answer with a MessageBootstrapResponse, in case the node is in a connected state and a fitting join parent
CMessageEmpty	Usage: A helper message type for the Search Exact Test. It has no functionality by itself. Not to be used outside of Search Exact Tests
CMessageFindQueryAnswer	Usage: A DSN sends a MessageFindQueryAnswer back to the requesting node (that sent this DSN a MessageFindQueryRequest) with the data that was aquired
CMessageFindQueryRequest	Usage: A node that wants to find data in the network can call the Entity Search Algorithm, which sends MessageFindQueryRequests to the requesting node's DSNs
CMessageFindReplacement	Usage: A node wants to leave the network, but cannot leave the position directly because it would violate the trees balancing conditions. Another node that can leave the position has to be found to replace the position of the leaving node. For this, the MessageFindReplacement gets forwarded (similar to Join messages) until a fitting node to replace is found
CMessageGetNeighbors	Usage: Currently only used in the join accept procedure in rare cases by the parent to get the correct adjacent neighbors for the child. The sender is giving a vector of neighbor relationships which he wants to know about from the targets routing information. The answer is supposed to be a MessageInformAboutNeighbors
CMessageInformAboutNeighbors	Usage: This message is an answer to a MessageGetNeighbors. It contains the node information about the requested relationships and/or network information. The node sends the message back
CMessageJoin	Usage: When a node wants to join the network, it sends a MessageJoin to one node in the network. If the fitting join position has been found, the target accepts the node as a new child. Otherwise, the target forwards the message with the set entering node further
CMessageJoinAccept	Usage: A fitting join position has been found by forwarding the MessageJoin appropriately. The target of the last MessageJoin sends a MessageJoinAccept to the entering node (new child). This message contains all information the entering node needs about its new neighbors and the network's fanout
CMessageJoinAcceptAck	Usage: After receiving a MessageJoinAccept, the new child must send a MessageJoinAcceptAck back to the new parent. It is needed to make sure the entering node still wants to join. Only after receiving this message, the parent node will send update messages through the network to inform the other neighbors about the joined node
CMessageLockNeighborRequest	Usage: The parent of a successor node sends a Lock Neighbor Request to its right and left neighbor. The receivers try to lock themselves for the leave procedure and respond with a MessageLockNeighborResponse, indicating success or failure of locking themselves
CMessageLockNeighborResponse	Usage: The answer to a MessageLockNeighborRequest, received by the parent of a successor node
CMessageRemoveAndUpdateNeighbors	Usage: Used in the leave and response algorithms for updating the routing information
CMessageRemoveNeighbor	Usage: A node is leaving the network. This is a notification to remove the given node from the routing information
CMessageRemoveNeighborAck	Usage: Is sent as a reply to either a MessageReplacementUpdate or MessageRemoveAndUpdateNeighbor to acknowledge the update of the routing information
►CMessageReplacementAck	Usage: The node that wants to leave the network receives a MessageReplacementOffer from a node that is willing to replace its position. As a response, the leaving node sends all of its necessary information in the MessageReplacementAck to the replacing node. After this message was sent, the node can finally leave the network
CLockedStates
CMessageReplacementNack	Usage: A MessageReplacementNack is sent back to the node to replace in case of a failure during the leave process. A failure can occur when the chosen successor is already replacing enother node or a MessageSignOffParentAnswer informed the current node about an unsucessful sign off from the parent
CMessageReplacementOffer	Usage: A MessageFindReplacement reached a node that can replace the leaving node. The node sends a MessageReplacementOffer to the leaving node to initiate the replacement process
CMessageReplacementUpdate	Usage: During the replacement process, the neighbor nodes of the leaving node / the replaced position need to get an update about the network information of the replaced position. Through the information in this message the neighbors can update the network information and eventually also remove the removed position from their information if they also have it as their neighbor
CMessageSearchExact	Usage: A node wants to send a message to another node in the network, but does not know the physical address, only the tree position. The Search Exact message gets forwarded into the right direction until it reaches its destination
CMessageSearchExactFailure	Usage: If a node cannot further forward a MessageSearchExact, but is also not the target node, it sends back a MessageSearchExactFailure to the requesting node
CMessageSignoffParentAnswer	Usage: The successor node waits for the MessageSignoffParentAnswer from its parent after sending a MessageSignoffParentRequest to it
CMessageSignoffParentRequest	Usage: The last node of the network, the chosen successor, sends a MessageSignoffParentRequest to its parent. The parent later answers with a MessageSignoffParentAnswer to notify the successor if the leave is allowed to continue
CMessageSubscriptionOrder	Usage: A node can send a MessageSubscriptionOrder to subscribe or unsubscribe itself from the data another node maintains for the specified keys
CMessageSubscriptionUpdate	Usage: If a node's local data is modified (inserted, updated or removed), it will send a subscription update the the subscribers of the key
CMessageUnlockNeighbor	Usage: Used for unlocking nodes after they were locked during a concurrent operation like leave
CMessageUpdateNeighbors	Usage: Informing a node about a new or updated neighbor. Used mainly in the join accept and leave procedure. The relationship of how to update the node has to be given
CMinhton
CMinhtonEntitySearchAlgorithm
CMinhtonFindEndAlgorithm
CMinhtonJoinAlgorithm
CMinhtonLeaveAlgorithm
CMinhtonLoggerNs3
CMinhtonMessage
CMinhtonMessageHeader
CMinhtonNode
CMinhtonSearchExactAlgorithm
CNetworkFacade
CNodeData
CNodeInfo
CNodeInfoHasher
CNotExpression
CNumericComparisonExpression
COrExpression
COverload	Definition of a helper struct used for visiting variant types
CPhysicalNodeInfo
CPhysicalNodeInfoHasher
CPresenceExpression
CProcedureInfo
CReceiveMessage
CResponseAlgorithmGeneral
CResponseAlgorithmInterface
CRoutingInformation
CSearchExactAlgorithmGeneral
CSearchExactAlgorithmInterface
CSendMessage
CSignal
CStringEqualityExpression
CTimeout
CTimeoutLengthsContainer
►Nnatter
►Ncore
CNetworkFacade
►Nexample
CApplication
►Nlogging
CLogger
CLoggerInterface
CNatterLoggerNs3
►Nminhcast
CBroadcastInfo
CForwardingLimit
CMinhcastMessage
CMinhcastNodeInfo
►CNatterMinhcast
CImpl
CMessage
CNatter
CNetworkInfoIPv4
►Nsola
CEventDissemination
CEventDisseminationMinhcast
CEventDisseminationMinhcastConfig
CLoggerInterface
CManagementOverlayMinhton
CRequest
CService
CSOLA
CStorage
CTopicMessage
►Nsolanet
►Nserializer
CBinarySerializer
CMessage
►CNetwork
CImpl
CQueue
►Nstd
Chash< daisi::path_planning::PPVector >
Chash< Info >
CClient	TCP client
CDatabaseColumnInfo
CDatabaseTable
CEvaluationInformation
CInfo
CMessageLoggingAdditionalInfo
CMessageLoggingInfo
CMinhtonJoinAlgorithmForTest
CMinhtonLeaveAlgorithmForTest
CServer	TCP Pong server
CTestEdge
CTestVertex