AES Algorithm. More...

Namespaces
namespace	contiki
namespace	lorien
namespace	rel_ops
namespace	tinyos
Classes
class	DsdvBroadcastMessage
class	DsdvRouting
	DSDV routing implementation of Routing Concept. More...
class	DsdvRoutingMessage
struct	DsdvRoutingTableValue
class	DsrRouteDiscoveryMessage
class	DsrRouting
	DSR routing implementation of Routing Concept. More...
class	DsrRoutingMessage
class	DsrRoutingTableValue
class	TreeBroadcastMessage
class	TreeRouting
	Tree routing implementation of Routing Concept. More...
class	TreeRoutingMessage
class	ContikiDebug
	Contiki Implementation of Debug Concept. More...
class	FacetProvider< ContikiOsModel, Facet_P >
class	ContikiOsModel
	Contiki implementation of Os Concept. More...
class	ContikiRadio
	Contiki Implementation of Radio concept. More...
struct	timer_item
class	ContikiTimer
	Contiki Implementation of Timer Concept. More...
class	DefaultReturnValues
	Implementation of Basic Return Values. More...
class	FacetProvider
class	iSenseDebug
	iSense Implementation of Debug Concept. More...
class	FacetProvider< iSenseOsModel, Facet_P >
class	iSenseOsModel
	iSense implementation of Os Concept. More...
class	iSenseWiselibApplication
class	iSenseRadioModel
	iSense Implementation of Radio concept. More...
class	iSenseTimerModel
	iSense Implementation of Timer Concept. More...
class	WiselibApplication< iSenseOsModel, Application_P >
class	LorienDebug
	Lorien Implementation of Debug Concept. More...
class	FacetProvider< LorienOsModel, Facet_P >
class	LorienOsModel
	Lorien implementation of Os Concept. More...
class	LorienRadioModel
	Lorien Implementation of Radio concept. More...
class	LorienTimerModel
	Lorien Implementation of Timer Concept. More...
struct	lxs
class	WiselibApplication< LorienOsModel, Application_P >
class	OsaDebug
	OSA Implementation of Debug Concept. More...
class	OsaOsModel
	OSA implementation of Os Concept. More...
class	OsaRadioModel
	OSA Implementation of Radio concept. More...
class	OsaTimerModel
	OSA Implementation of Timer Concept. More...
struct	_TrRecpList
class	ScwDebug
	Scatterweb^2 Implementation of Debug Concept. More...
class	ScwOsModel
	Scatterweb^2 implementation of Os Concept. More...
class	ScwRadioModel
	Scatterweb^2 Implementation of Radio concept. More...
struct	scw_timer_item
class	ScwTimerModel
	Scatterweb^2 Implementation of Timer Concept. More...
class	ShawnDebug
	Shawn Implementation of Debug Concept. More...
class	FacetProvider< ShawnOsModel, Facet_P >
class	ShawnOsModel
	Shawn implementation of Os Concept. More...
class	ShawnRadioModel
	Shawn Implementation of Radio concept. More...
class	ShawnTimerModel
	Shawn Implementation of Timer Concept. More...
struct	ShawnOs
class	WiselibApplication< ShawnOsModel, Application_P >
class	WiselibShawnStandaloneProcessor
class	WiselibShawnStandaloneProcessorFactory
class	TinyOsClockModel
	TinyOs Implementation of Clock Concept. More...
class	TinyOsDebug
	TinyOs Implementation of Debug Concept. More...
class	TinyOsModel
	TinyOs implementation of Os Concept. More...
class	TinyOsPositionModel
	TinyOs Implementation of Position ConceptTinyOs implementation of the Position Concept ... More...
class	TinyOsRadioModel
	TinyOs Implementation of Radio concept. More...
class	TinyOsTimerModel
	TinyOs Implementation of Timer Concept. More...
class	WiselibApplication
class	StaticArrayRoutingTable
class	StlMapRoutingTable
class	RadioBase
	Base radio class. More...
class	RoutingBase
	Base routing class. More...
class	SensorCallbackBase
	Base State Callback classBasic state callback class that provides helpful methods like registration of callbacks. More...
class	StateCallbackBase
	Base State Callback classBasic state callback class that provides helpful methods like registration of callbacks. More...
class	UartBase
	Base Uart classBasic uart class that provides helpful methods like registration of callbacks. More...
class	normal_iterator
struct	input_iterator_tag
struct	output_iterator_tag
struct	forward_iterator_tag
struct	bidirectional_iterator_tag
struct	random_access_iterator_tag
struct	iterator
struct	iterator_traits
struct	iterator_traits< Iterator_P * >
struct	pair
class	vector_static
struct	FpSerialization
struct	FpSerialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, Type_P, Size_P >
struct	FpSerialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, double, 4 >
struct	FpSerialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, double, 4 >
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, pair< A, B > >
struct	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, pair< A, B > >
struct	Serialization
	Following implementation assumes "Little Endian". More...
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, Type_P >
	Generic implementation for Big Endian. More...
struct	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, bool >
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, bool >
struct	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, uint16_t >
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, uint16_t >
struct	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, int16_t >
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, int16_t >
struct	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, double >
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, double >
class	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, std::pair< A, B > >
class	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, std::pair< A, B > >
class	aggregate_base
	Class that wraps the aggregate value and hides the specific aggregate function. More...
class	Aggregation
class	AggregateMsg
	The message that the aggregation protocol is using to send the aggregate values. More...
class	greedy_partition
	Class that wraps the aggregate value and hides the specific aggregate function. More...
class	Sensor
	A sensor that takes part in leader election and clustering. More...
class	Message
class	MessageDestination
class	MessageQueue
	A buffer for messages received from a Radio, and a factory for Message objects. More...
class	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, TopologyMessage::topology_message_header_t >
class	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, TopologyMessage::topology_message_header_t >
class	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, TopologyMessage::serializable_topology_record_t >
class	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, TopologyMessage::serializable_topology_record_t >
class	TopologyMessage
	A message sent by a sensor in the BGU clustering algorithm. More...
class	AttributeClusterMsg
class	BfsClustering
	BFS Clustering. More...
class	DfsClustering
	DFS Clustering. More...
class	FrontsCore
	Fronts clustering core component. More...
class	HdlClustering
	HDL clustering algorithm. More...
class	HighwayCluster
	Highway clustering algorithm. More...
class	JoinAccClusterMsg
class	JoinClusterMsg
class	LcaCore
	LCA clustering core component. More...
class	MaxmindCore
	MaxMinD clustering core component. More...
class	MocaCore
	Moca clustering core component. More...
class	AtributeClusterHeadDecision
	Attribute cluster head decision module. More...
class	LeachClusterHeadDecision
	LEACH cluster head decision module. More...
class	MaxmindClusterHeadDecision
	MaxMinD cluster head decision module. More...
class	ProbabilisticClusterHeadDecision
	Probabilistic cluster head decision module. More...
class	FrontsIterator
	Fronts iterator module. More...
class	MaxmindIterator
	MaxMinD iterator module. More...
class	NormalIterator
	Normal iterator module. More...
class	OverlappingIterator
	Overlapping iterator module. More...
class	BfsJoinDecision
	BFS join decision module. More...
class	FrontsJoinDecision
	Fronts join decision module. More...
class	MaxmindJoinDecision
	MaxMinD join decision module. More...
class	MocaJoinDecision
	Moca join decision module. More...
class	ResumeClusterMsg
class	ECGDH
class	SecureDfsClustering
	Secured DFS Clustering. More...
class	SecureDFSMessage
class	HKC
class	SecureHdlClustering
	Secured HDL Clustering. More...
class	SecureHdlMessage
struct	HKCelement_t
class	ClusterRadio
class	ClusterRadioMsg
class	ColorsTable
class	IMJudgedColoring
	IM Judged Coloring Algorithm. More...
class	IMJudgedColoringMessage
struct	question
struct	ask_color
class	JudgedColoring
	udged Coloring Algorithm More...
class	JudgedColoringMessage
class	PKJudgedColoring
	PK Judged Coloring Algorithm. More...
struct	rrep_c_change
struct	rrep_fb
struct	rrep_sf
class	RandColoring
	Random Coloring Algorithm. More...
struct	rep_c_change
struct	rep_fb
struct	rep_sf
class	TwoHopsColoring
	Two Hops Coloring Algorithm. More...
class	TwoHopsMessage
class	AES
class	DiffieHellmanAlgorithm
	Diffie-Hellman Algorithm for the Wiselib. More...
class	DiffieHellmanCryptoHandler
class	DiffieHellmanList
class	DiffieHellmanMessage
struct	sha256_context
class	Sha256
struct	Elt
struct	Curve
struct	Point
struct	Params
struct	PrivKey
struct	PubKey
struct	DataBlock
class	ECC
	ECC Algorithm. More...
class	ECCFP
	ECCFP Algorithm. More...
class	ECDH
	ECDH Algorithm. More...
class	ECDSA
	ECDSA Algorithm. More...
class	ECIES
	ECIES Algorithm. More...
class	ECIESFP
	ECIESFP Algorithm. More...
class	DummyApp
class	EschenauerGligorAlgorithm
	Eschenauer-Gligor Algorithm. More...
class	EschenauerGligorCryptoHandler
class	EschenaurGligorMessage
class	HARPS
	HARPS Algorithm. More...
class	HARPSKEYPOOLGENERATOR
class	HARPSUTILS
class	PMP
struct	SHA1Context
class	SHA1
	SHA1 Algorithm. More...
class	SCHNORRZKPProve
class	SCHNORRZKPVerify
class	ZKPNINTProve
class	ZKPNINTVerify
class	TESTOFDLEQUALITYProve
class	TESTOFDLEQUALITYVerify
class	ZKPProve
class	ZKPVerify
class	ZKPOFSINGLEBITProve
class	ZKPOFSINGLEBITVerify
class	EndToEndCommunication
	Implementation of the end-to-end-communication used for the FRONTS-Experiments. More...
class	CommunicationMessage
class	E2ecMessage
class	AntsDutyCyclingAlgorithm
	Duty cycling algorithm using ant behavior. More...
class	AntDutyCyclingMessage
class	FakeClustering
class	Keylevels
class	KeylevelsMessage
struct	p
struct	ki
struct	sk
class	KeyShare
class	TTLFlooding
class	DbfsGraph
	Dbfs graph implementation of Graph ConceptDbfs graph implementation of Graph Concept. More...
class	DdfsGraph
	Ddfs graph implementation of Graph ConceptDdfs graph implementation of Graph Concept. More...
struct	gkmsg
class	DistanceBasedLocalization
	Three-phase localization. More...
class	SimpleMatrix
class	LocalizationStatistic
	Class that provides statistic information. More...
class	Vec
class	LocalizationDvHopMessage
class	LocalizationDvCalMessage
class	LocalizationDvHopModule
	Module implementing DV-hop. More...
class	LocalizationEuclideanInitMessage
class	LocalizationEuclideanAnchorMessage
class	LocalizationEuclideanNeighborMessage
class	LocalizationEuclideanModule
	Module implementing euclidean distance estimation. More...
class	LocalizationGpsFreeLcsInitMessage
class	LocalizationGpsFreeLcsNeighborMessage
class	LocalizationGpsFreeLcsModule
	Module that implements GPS-free Local Coordinate System building. More...
class	LocalizationSumDistMessage
class	LocalizationSumDistModule
	Module implementing Sum-dist. More...
class	LocalizationModule
	Basic localization module to act with LocalizationProcessor. More...
class	LocalizationNopModule
	Module that does nothing. More...
class	LocalizationGpsFreeNcsLcsMessage
class	LocalizationGpsFreeNcsModule
	Module implementing GPS-free Network Coordinate System building. More...
class	LocalizationLaterationModule
class	LocalizationMinMaxModule
class	LocalizationIterLaterationMessage
class	LocalizationIterLaterationSoundMessage
class	LocalizationIterLaterationModule
	Module implementing refinement by iterative lateration. More...
class	LocalizationLocalCoordinateSystem
	Local Coordinate System. More...
class	LocalizationNeighborInfo
	Store information about a single neighbor. More...
class	LocalizationNeighborhood
	Basic neighborhood operations. More...
class	LocalizationSharedData
class	LQIDistanceModel
class	Geometry
class	Greedyloc
class	Greedyloc_Message
class	LocalizationBase
	Base localization classBasic localization class that provides helpful classes like registration of callbacks. More...
class	Triangulation
	triangulation algorithm implementation More...
class	TriangulationMessage
class	IndividualLinkMetrics
	Xyz implementation of Xzy ConceptXyz implementation of Xyz concept ... More...
class	IndividualLinkMetricsMessage
struct	OneHopLinkMetricsDataItem
class	OneHopLinkMetrics
	Xyz implementation of Xzy ConceptXyz implementation of Xyz concept ... More...
class	OneHopLinkMetricsReplyMessage
class	OneHopLinkMetricsRequestMessage
class	Echo
	Echo. More...
class	EchoMsg
class	PrivacyType
class	PrivacyMessageType
class	SecureRadio
class	AODVRouteDiscoveryMessage
class	AODVRouting
	DSR routing implementation of Routing ConceptDSR routing implementation of Routing Concept ... More...
class	AODVRoutingMessage
struct	AODVRoutingTableValue
class	AutoCast
	AutoCast routing implementation of Routing Concept. More...
class	AutoCast_Message
class	DataUnit
class	ControlledTopologyTreeRouting
	Tree routing implementation of Routing ConceptTree routing implementation of Routing Concept ... More...
class	DYMORouteDiscoveryMessage
class	DYMORouting
	DSR routing implementation of Routing ConceptDSR routing implementation of Routing Concept ... More...
class	DYMORoutingMessage
struct	DYMORoutingTableValue
class	FloodingAlgorithm
	Flooding Algorithm for the Wiselib. More...
class	FloodingMessage
class	Greedy
	Greedy routing algorithm. More...
class	Greedy_Message
class	LazyType
	Lazy routing algorithm. More...
class	LazyMessageType
class	OlsrBroadcastHelloMessage
class	OlsrBroadcastTcMessage
class	OlsrRouting
	Olsr routing implementation of Routing Concept in group routing_concept Olsr routing implementation of Routing Concept. More...
class	OlsrRoutingMessage
struct	OlsrRoutingTableValue
class	SecRouting
	Sec routing. More...
class	StaticRoutingAlgorithm
	Flooding Algorithm for the Wiselib. More...
class	StaticRoutingMessage
class	ToraBroadcastMessage
class	ToraRouting
	Tora routing algorithm. More...
struct	height
class	ToraRoutingMessage
struct	ToraRoutingTableValue
class	TpsnSynchronization
	Tpsn synchronization implementation of Synchronization ConceptTpsn synchronization implementation of Synchronization Concept. More...
class	TpsnSynchronizationMessage
class	LtsSynchronization
class	LtsSynchronizationMessage
class	rbs
	Tree routing implementation of Routing ConceptTree routing implementation of Routing Concept ... More...
class	rbsReceiverLocalTimeMessage
class	SynchronizationBase
class	SequentialTry
class	SequentialTryPingMessage
class	SequentialTryPongMessage
class	BasicTopology
	Dummy implementation of Topology ConceptDummy implementation of Topology Concept. More...
class	BasicTopologyBroadcastMessage
class	CbtcTopology
	Cbtc topology implementation of Topology ConceptCbtc topology implementation of Topology concept ... More...
class	CbtcTopologyMessage
class	CbtcTopologyNeighbours
class	FlssTopology
	Flss topology implementation of Topology ConceptFlss topology implementation of Topology concept ... More...
class	KNeighBroadcastMessage
class	KNeighListMessage
class	KneighProtocol
	K-neigh symmetric topology control implementation of Topology ConceptK-neigh symmetric topology control implementation of Topology Concept. More...
class	LmstTopology
	Lmst topology implementation of Topology ConceptLmst topology implementation of Topology concept ... More...
class	LmstTopologyMessage
class	TopologyBase
	Base routing classBasic routing class that provides helpful classes like registration of callbacks. More...
class	XTCBroadcastMessage
class	XTCOrderMessage
class	XTCProtocol
	K-neigh symmetric topology control implementation of Topology ConceptK-neigh symmetric topology control implementation of Topology Concept. More...
class	PLTT_AgentType
class	PLTT_MessageType
class	PLTT_NodeType
class	PLTT_NodeTargetType
class	PLTT_PassiveType
class	PLTT_ReliableAgentType
class	PLTT_TargetSpreadMetricType
class	PLTT_PassiveSpreadMetricType
class	PLTT_PassiveSpreadMetricsType
class	PLTT_TargetType
class	PLTT_TraceType
class	PLTT_TrackerType
class	PLTT_TrackerTrackingMetricType
class	PLTT_PassiveTrackingMetricType
class	PLTT_PassiveTrackingMetricsType
class	ContikiByteUartModel
	Contiki Implementation of Radio conceptContiki implementation of the Radio concept ... More...
class	ContikiClockModel
	Contiki Implementation of Clock ConceptContiki implementation of the Clock Concept ... More...
class	ContikiUartModel
	Contiki Implementation of Radio conceptContiki implementation of the Radio concept ... More...
class	ContikiDistanceModel
class	ContikiExtendedDataRadioModel
	Contiki Implementation of Radio conceptContiki implementation of the Radio concept ... More...
class	ContikiPositionModel
	OSA Implementation of Position ConceptOSA implementation of the Position Concept ... More...
class	FeuerwhereRadioModel
	Feuerwhere Implementation of Radio conceptFeuerwhere implementation of the Radio concept ... More...
class	FeuerwhereDebug
class	FeuerwhereOsModel
struct	FeuerwhereTimerItem
class	FeuerwhereTimerModel
	Feuerwhere Implementation of Timer ConceptFeuerwhere implementation of the Timer Concept ... More...
class	iPhoneDebug
class	FacetProvider< iPhoneOsModel, Facet_P >
class	iPhoneOsModel
class	iPhoneRadioModel
class	iPhoneSystem
class	iPhoneTimerModel
class	TubsHallwayRgbActuator
	Shawn actuator - setting a tagShawn implementation of the Actuator Concept ... More...
class	iSenseClockModel
	iSense Implementation of Clock Concept More...
class	iSenseSerialComBufferUartModel
	iSense Implementation of Serial Communication FacetiSense implementation of the Serial Communication Facet. More...
class	iSenseSerialComUartModel
	iSense Implementation of Serial Communication FacetiSense implementation of the Serial Communication Facet. More...
class	iSenseDistanceModel
class	iSenseExtendedTime
	iSense Implementation of Extended Time ConceptiSense implementation of the Extended Time Concept ... More...
class	iSenseExtendedTxRadioModel
class	iSenseExtendediSenseStyleTxRadioModel
class	iSenseLightSensor
	iSense Implementation of Clock Concept , ,iSense implementation of the Clock Concept ... More...
class	iSensePirSensor
class	iSensePositionModel
	OSA Implementation of Position ConceptOSA implementation of the Position Concept ... More...
class	iSenseRandModel
class	iSenseTempSensor
class	ComISensePacket
class	ComISenseRadioModel
class	ComIsenseTxPower
	This class implements the txpower_concept. More...
class	PCClockModel
class	PCComUartModel
	Parameters address_ -> UART Device address e.g. More...
class	PCDebug
class	FacetProvider< PCOsModel, Facet_P >
class	PCInterruptibleTimerModel
class	PCOs
class	PCOsModel
class	PCRandModel
class	TimerQueue
class	PCTimerModel
class	WiselibApplication< PCOsModel, Application_P >
class	Pose
class	RoombaModel
	Represents a roomba robot. More...
class	RoombaAngle
class	RoombaEventSensor
class	RoombaMotion
class	ShawnActuatorTagModel
	Shawn actuator - setting a tagShawn implementation of the Actuator Concept ... More...
class	ShawnClockModel
	Shawn Implementation of Clock ConceptShawn implementation of the Clock Concept ... More...
class	ShawnDistanceModel
class	ShawnDummyComUartModel
	iSense Implementation of Com FacetiSense implementation of the Com Facet ... More...
class	ShawnPositionModel
	Shawn Implementation of Position ConceptShawn implementation of the Position Concept ... More...
class	ShawnRandModel
class	ShawnRemoteUartDebug
class	ShawnStringTagUartModel
	Shawn UART implementation using String Tags. More...
class	ShawnTxRadioModel
	OSA Implementation of Radio conceptOSA implementation of the Radio concept ... More...
class	TinyOsComUartModel
class	TriSOSClockModel
class	TriSOSDebug
class	FacetProvider< TriSOSOsModel, Facet_P >
class	TriSOSOsModel
class	TriSOSRadio
	TriSOS Implementation of Radio conceptTriSOS implementation of the Radio concept ... More...
class	TriSOSTimer
	TriSOS Implementation of Timer Concept (using Contiki Timer)TriSOS implementation of the Timer Concept ... More...
class	ConditionalMotion
	Moves a robot forward until a condition occurs. More...
class	ControlledMotion
class	DirectMotion
	Implements the "Motion" concept. More...
class	PoseEstimation
class	Position2D
class	ConnectivityType
class	NodeType
struct	PositionType
class	Position3DType
class	Position2DType
class	SerializableType
class	SerializableSet2_Type
class	SerializableSet3_Type
class	SerializableSet4_Type
class	SerializableSet5_Type
class	SerializableDynamicType
class	SerializableDynamicListType
class	SerializableDynamicSet2_Type
class	SerializableDynamicSet3_Type
class	SerializableDynamicSet4_Type
class	SerializableDynamicSet5_Type
class	testvolume
class	VolumeMsg
class	VolumeRadio
class	ReliableMsg
class	ReliableRadio
class	testreliable
class	SunSpotRadio
	Wiselib Radio implementation that supports communication with sunspot devices. More...
class	NewDeleteAllocator
	Simple new/delete allocator. More...
class	BaseExtendedData
class	ClusteringBase
	Base clustering classBasic clustering class that provides helpful methods like registration of callbacks. More...
class	ExtendedRadioBase
	Base extended radio classBasic extended radio class that provides helpful methods like registration of callbacks. More...
class	SensorValue
class	SubscribeHandler
class	SwapRequestMessage
class	SwapResponseMessage
class	SwapService
class	AdjacencyList
class	EnergyConsumptionRadioCallback
class	EneryConsumptionRadioModel
	Implementation of Radio Concept that approximates the consumed energy. More...
class	PacketSnifferRadioModel
	Implementation of Radio Concept that outputs packet information about al packages it receives. More...
class	list_dynamic
struct	maplist_adaptors
struct	list_node
class	list_iterator
struct	list_static
class	MapList
	Builds a map on top of an arbitrary list implementation. More...
class	MapStaticVector
class	priority_queue
class	queue_static
class	reverse_iterator
	allows to step backwards More...
class	set_static
class	StaticString
class	string_dynamic
	Dynamic string implementation. More...
class	string_creator
struct	Serialization< OsModel_P, WISELIB_BIG_ENDIAN, BlockData_P, Vec< Arithmatic_P > >
struct	Serialization< OsModel_P, WISELIB_LITTLE_ENDIAN, BlockData_P, Vec< Arithmatic_P > >
class	SpyglassPacket
class	StandaloneMath
class	VirtualRadioModel
	iSense Implementation of Radio ConceptiSense implementation of the Radio concept ... More...
class	RemoteUartModel
	Virtual Radio Implementation of Radio ConceptVirtual Radio implementation of the Radio concept ... More...
class	RemoteUartInMessage
class	ManagedSensor
class	SensorController
	Virtual Radio Implementation of Radio ConceptVirtual Radio implementation of the Radio concept ... More...
class	SensorEncoding
class	SensorEncoding< bool >
class	SensorEncoding< uint8_t >
class	SensorEncoding< int8_t >
class	SensorEncoding< uint16_t >
class	SensorEncoding< int16_t >
class	SensorEncoding< uint32_t >
class	SensorEncoding< int32_t >
class	SensorEncoding< uint64_t >
class	SensorEncoding< int64_t >
class	SensorEncoding< double >
class	SensorEncoding< char * >
class	VirtualExtendedTxRadioModel
	Virtual Radio Implementation of Radio ConceptVirtual Radio implementation of the Radio concept ... More...
class	VirtualLinkInMessage
class	VirtualLinkOutMessage
class	VirtualRadioModel_old
	Virtual Radio Implementation of Radio ConceptVirtual Radio implementation of the Radio concept ... More...
Typedefs
typedef delegate3< void, uint16_t, uint8_t, uint8_t * >	contiki_radio_delegate_t
typedef void(*	contiki_radio_fp )(struct abc_conn *c)
typedef delegate1< void, void * >	contiki_timer_delegate_t
typedef uint8	uint8_t
typedef int8	int8_t
typedef uint16	uint16_t
typedef int16	int16_t
typedef uint32	uint32_t
typedef int32	int32_t
typedef uint64	uint64_t
typedef int64	int64_t
typedef delegate3< void, TNodeID_Int, uint8_t, uint8_t * >	lorien_radio_delegate_t
typedef struct wiselib::lxs	LXState
typedef unsigned int	TNodeID_Int
typedef delegate3< void, TNodeID_Int, uint8_t, uint8_t * >	osa_radio_delegate_t
typedef struct wiselib::_TrRecpList	TrRecpList
typedef delegate3< void, netaddr_t, uint8_t, uint8_t * >	scw_radio_delegate_t
typedef delegate1< void, void * >	scw_timer_delegate_t
typedef struct HKCelement_t	HKCelement_t
typedef struct Elt	Elt
typedef struct Curve	Curve
typedef struct Point	Point
typedef struct Params	Params
typedef struct PrivKey	PrivKey
typedef struct PubKey	PubKey
typedef struct DataBlock	DataBlock
typedef int16_t	index_t
typedef uint8_t	word_t
typedef uint8_t	state_t
typedef uint32_t	NN_DIGIT
typedef uint64_t	NN_DOUBLE_DIGIT
typedef uint8_t	NN_UINT
typedef uint16_t	NN_UINT2
typedef struct wiselib::SHA1Context	SHA1Context
typedef wiselib::OSMODEL	Os
typedef Os::Rand	Random
typedef struct wiselib::p	key
typedef struct wiselib::ki	key_info
typedef struct wiselib::sk	group_key
typedef delegate1< int, uint8_t >	contiki_byte_uart_delegate_t
typedef contiki_byte_uart_delegate_t	byte_uart_delegate_t
typedef int(*	contiki_byte_uart_fp )(uint8_t)
typedef delegate2< void, uint8_t, uint8_t * >	contiki_uart_delegate_t
typedef contiki_uart_delegate_t	uart_delegate_t
typedef void(*	contiki_uart_fp )(uint8_t, uint8_t *)
typedef delegate3< void, uint8_t, uint8_t, char * >	feuerwhere_radio_delegate_t
typedef feuerwhere_radio_delegate_t	radio_delegate_t
typedef delegate1< void, void * >	feuerwhere_timer_delegate_t
typedef delegate3< void, uint16_t, uint8_t, uint8_t * >	trisos_radio_delegate_t
typedef void(*	trisos_radio_fp )(uint8_t data_length, uint8_t *data)
typedef delegate1< void, void * >	trisos_timer_delegate_t
typedef int	list_size_t
	type for list size
Enumerations
enum	DsdvRoutingMsgIds { DsdvBroadcastMsgId = 110, DsdvRoutingMsgId = 111 }
enum	DsrRoutingMsgIds { DsrRouteRequestMsgId = 120, DsrRouteReplyMsgId = 121, DsrRoutingMsgId = 122 }
enum	Endianness { WISELIB_LITTLE_ENDIAN, WISELIB_BIG_ENDIAN }
enum	msg_ids { CLRADIO_MSG = 39, JOIN = 43, REJOIN = 43, RESUME = 44, CONVERGECAST = 44, ATTRIBUTE = 45, FLOOD = 45, REFORM = 46, INFORM = 47, JOIN_ACCEPT = 22, NEIGHBOR_DISCOVERY = 25, NEIGHBOR_REPLY = 26, JOIN_REQUEST = 27 }
enum	node_type { UNCLUSTERED = 0, SIMPLE = 1, HEAD = 2, GATEWAY = 3 }
enum	EventIds { CLUSTER_HEAD_CHANGED = 0, NODE_JOINED = 1, NODE_LEFT = 2, CLUSTER_FORMED = 3, GATEWAY_NODE = 4 }
enum	ClusterIds { UNKNOWN_CLUSTER_HEAD = -1 }
enum	message_types { JUDGE_START = 0, NODE_START = 1, BROAD_JUDGE = 2, REQUEST_COLOR = 3, ASSIGN_COLOR = 4, COLOR_ASSIGNED = 5, REASSIGN_COLOR = 6, ASK_PERMISSION = 7, GIVE_PERMISSION = 8, DECL_PERMISSION = 10, COLOR_NOT_ASSIGNED = 9, TAKE_TURN = 11, ASK_JUDGE = 12, ASK_COLOR = 13, REPLY_COLOR = 14, FINAL_CHECK = 15, CHECK_OK = 16, CHECK_NOT_OK = 17, CENT_END = 18, ALL_END = 19 }
enum	ms_types { NODE_STARTED = 20, REP_CHANGE = 21, REP_SAT = 22, REP_FBID = 23, REQ_COLOR = 24, REP_COLOR = 25 }
enum	KeylevelsMessageTypes { KEY_ACK = 90, GROUP_KEY, NEIGHBORHOOD_SEEK, NEIGHBORHOOD_ACK, TTL_MESSAGE, KEY_ACK = 90, GROUP_KEY, NEIGHBORHOOD_SEEK, NEIGHBORHOOD_ACK, TTL_MESSAGE }
enum	KeylevelsMessageTypes { KEY_ACK = 90, GROUP_KEY, NEIGHBORHOOD_SEEK, NEIGHBORHOOD_ACK, TTL_MESSAGE, KEY_ACK = 90, GROUP_KEY, NEIGHBORHOOD_SEEK, NEIGHBORHOOD_ACK, TTL_MESSAGE }
enum	LaterationType { lat_anchors, lat_confident }
enum	AODVRoutingMsgIds { RREQ = 140, RREP = 141, ERR = 142, DATA = 145, HELO = 146 }
enum	DYMORoutingMsgIds { DYMO_RREQ = 200, DYMO_RREP = 201, DYMO_ERR = 202, DYMO_DATA = 300 }
enum	OlsrRoutingMsgIds { HELLO = 101, TC = 102, DATA = 145 }
enum	ToraRoutingMsgIds { ToraBroadcastMsgId = 190, QRY = 191, UPD = 192, CLR = 193, DATA = 145 }
enum	SequentialTryMsgIds { SequentialTryPingMsgId = 207, SequentialTryPongMsgId = 208 }
enum	BasicTopologyMsgIds { BasicTopologyBroadcastMsgId = 206 }
enum	KNeighTopologyMsgIds { KNeighBroadcastMsgId = 202, KNeighListMsgId = 203 }
enum	XTCTopologyMsgIds { XTCBroadcastMsgId = 204, XTCOrderMsgId = 205 }
enum	SensorEncodings { UNKNOWN_ENCODING = 0xff, BOOL = 0x01, UINT8 = 0x02, INT8 = 0x03, UINT16 = 0x04, INT16 = 0x05, UINT32 = 0x06, INT32 = 0x07, UINT64 = 0x08, INT64 = 0x09, STRING = 0x0a, DOUBLE = 0x0b }
Functions
static void	abc_recv (struct abc_conn *c)
	PROCESS (contiki_radio_process,"Contiki Radio")
	PROCESS_THREAD (contiki_radio_process, ev, data)
int	contiki_radio_add_receiver (contiki_radio_delegate_t &d)
void	contiki_radio_del_receiver (int idx)
void	contiki_notify_receivers (struct abc_conn *c)
void	init_contiki_radio (void)
	PROCESS (timer_process,"timer process")
	PROCESS_THREAD (timer_process, ev, data)
void	init_contiki_timer (void)
timer_item *	get_timer_item_ref (void)
static unsigned int	send (Component comp, unsigned char data, size_t len, unsigned int port)
static unsigned int	sendTo (Component comp, unsigned char data, size_t len, unsigned int id, unsigned int port)
static int	reg_recv_callback (Component comp, Component r, unsigned int port)
static int	unreg_recv_callback (Component comp, Component r, unsigned int port)
static unsigned int	get_id (Component *comp)
static int	set_id (Component *comp, int id)
static const char *	get_id_type (Component *comp)
static int	enable (Component *comp)
static int	disable (Component *comp)
static int	timer_elapse (Component comp, void tid, void *ptr_o)
static int	osa_recv (Component comp, unsigned char data, size_t len, unsigned int from_id, unsigned int port)
static int	start (Component *comp)
static int	stop (Component *comp)
int	construct (Component *comp)
int	destruct (Component *comp)
static void	scw_notify_receivers (struct netpacket_handler_args *args)
void	scw_radio_init (void)
void	scw_radio_add_receiver (scw_radio_delegate_t receiver)
void	scw_radio_del_receiver (scw_radio_delegate_t receiver)
static void	timer_fired (void *data)
void	scw_timer_init (void)
bool	scw_timer_add_timer (uint32_t millis, scw_timer_delegate_t delegate, void *userdata)
template<class First , class Second >
bool	operator< (const pair< First, Second > &p1, const pair< First, Second > &p2)
template<typename OsModel_P , typename BlockData_P , typename Type_P >
Type_P	read (BlockData_P *target)
template<typename OsModel_P , typename BlockData_P , typename Type_P >
void	read (BlockData_P *target, Type_P &value)
template<typename OsModel_P , typename BlockData_P , typename Type_P >
OsModel_P::size_t	write (BlockData_P *target, Type_P &value)
template<typename T1 , typename T2 >
wiselib::pair< T1, T2 >	make_pair (const T1 &first, const T2 &second)
template<typename Arithmatic_P >
static Arithmatic_P	collinear_measure (Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P=0)
	To decide, whether a triangle is collinear or not, the sum of the two smallest sides minus the largest side is formed.
template<typename Arithmatic_P >
static bool	is_collinear (Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P=0)
	This methode forms the collinear_measure() and decides, whether the triangle is collinear or not.
template<typename Arithmatic_P >
static void	rotate_2D (Arithmatic_P, Vec< Arithmatic_P > &, const Vec< Arithmatic_P > &=Vec< Arithmatic_P >(0.0, 0.0, 0.0))
	This method rotates a given coordinate by a given radius.
template<typename Arithmatic_P >
static Arithmatic_P	angle_vec (const Vec< Arithmatic_P > &)
	This method computes the angle of a vector in respect to the x-axis.
template<typename Arithmatic_P >
static Arithmatic_P	normalize_angle (Arithmatic_P)
	This method sets the angle between 0 and 2*PI.
template<typename Arithmatic_P >
static bool	compute_basis_coords (Arithmatic_P, Arithmatic_P, Arithmatic_P, Vec< Arithmatic_P > &, Vec< Arithmatic_P > &)
	This method computes relative coordinates of two nodes given the distances from source to the two nodes and distance between latter.
template<typename Arithmatic_P >
static bool	compute_rel_coord_triangulisation (Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P, Vec< Arithmatic_P > &, Arithmatic_P)
	This method computes the relative coordinate of a node j depending on the distances to two others p and q.
template<typename OsModel_P , typename NeighborInfoList , typename Arithmatic_P >
bool	est_pos_min_max (const NeighborInfoList &, Vec< Arithmatic_P > &)
	Position estimation with distance to anchors and their positions.
template<typename OsModel_P , typename NeighborInfoList , typename Arithmatic_P >
bool	est_pos_lateration (const NeighborInfoList &, Vec< Arithmatic_P > &, const LaterationType &, bool)
	Position estimation with distance to anchors and their positions.
template<typename OsModel_P , typename NeighborInfoList , typename Arithmatic_P >
bool	check_residue (const NeighborInfoList &, const Vec< Arithmatic_P > &, const LaterationType &, Arithmatic_P)
	This Method checks, whether an estimated position is accepted or not.
template<typename OsModel_P , typename DistancePair_P , typename Arithmatic_P >
DistancePair_P	trilateration_distance (Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P, Arithmatic_P)
	This method calculates the distance between two nodes using only distance information with trilateration.
template<typename OsModel_P , typename Neighborhood , typename NeighborInfoList , typename Arithmatic_P >
void	collect_neighbors (Neighborhood &, const LaterationType &, NeighborInfoList &)
	This method collects different types of neighbors in a NeighborInfoList used in est_pos_lateration() and check_residue().
	PROCESS (contiki_byte_uart_process,"Contiki Byte Based Uart")
	PROCESS_THREAD (contiki_byte_uart_process, ev, data)
int	contiki_byte_uart_add_receiver (contiki_byte_uart_delegate_t &d)
void	contiki_byte_uart_del_receiver (int idx)
int	contiki_byte_uart_notify_receivers (uint8_t data)
void	init_contiki_byte_uart (void)
	PROCESS (contiki_uart_process,"Contiki Uart")
	PROCESS_THREAD (contiki_uart_process, ev, data)
int	contiki_uart_add_receiver (contiki_uart_delegate_t &d)
void	contiki_uart_del_receiver (int idx)
static int	getIndexOf (unsigned char c)
void	encodeBase64 (unsigned char b, unsigned char *result)
unsigned char	decodeBase64 (unsigned char *b64)
void	contiki_uart_notify_receivers (uint8_t len, uint8_t *data)
void	init_contiki_uart (void)
int	feuerwhere_radio_add_receiver (feuerwhere_radio_delegate_t &d)
void	feuerwhere_radio_del_receiver (int idx)
static void	protocol_handler (void msg, int msg_size, packet_info_t packet_info)
void	init_feuerwhere_cc1100_radio (void)
void	feuerwhere_notify_receivers (struct abc_conn *c)
void	init_timer (void)
void	feuerwhere_timer_thread (void)
	Describes a message object which can be sent between threads.
FeuerwhereTimerItem *	get_feuerwhere_timer_item (void)
const TriSOSOsModel &	get_trisos_os_model ()
void	wiselib_trisos_init ()
static void	rf_call ()
int	trisos_radio_add_receiver (trisos_radio_delegate_t &d)
void	trisos_radio_del_receiver (int idx)
void	trisos_notify_receivers (uint8_t length, uint8_t *data)
void	init_trisos_radio (void)
void	init_trisos_timer (void)
template<typename Float , typename block_data , typename Os >
Float	dist (const PositionType< Float, block_data, Os > p1, const PositionType< Float, block_data, Os > p2)
template<typename Float , typename block_data , typename Os >
Float	distsq (const PositionType< Float, block_data, Os > p1, const PositionType< Float, block_data, Os > p2)
template<class InputIterator , class Function >
Function	for_each (InputIterator first, InputIterator last, Function f)
template<class InputIterator , class T >
InputIterator	find (InputIterator first, InputIterator last, T const &value)
template<class InputIterator , class Predicate >
InputIterator	find_if (InputIterator first, InputIterator last, Predicate pred)
template<class ForwardIterator >
ForwardIterator	adjacent_find (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator , class BinaryPredicate >
ForwardIterator	adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate pred)
template<class InputIterator , class T >
iterator_traits< InputIterator > ::difference_type	count (InputIterator first, InputIterator last, T const &value)
template<class InputIterator , class Predicate >
iterator_traits< InputIterator > ::difference_type	count_if (InputIterator first, InputIterator last, Predicate pred)
template<class InputIterator1 , class InputIterator2 >
bool	equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
template<class InputIterator1 , class InputIterator2 , class BinaryPredicate >
bool	equal (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred)
template<class InputIterator1 , class InputIterator2 >
pair< InputIterator1, InputIterator2 >	mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2)
template<class InputIterator1 , class InputIterator2 , class BinaryPredicate >
pair< InputIterator1, InputIterator2 >	mismatch (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred)
template<class ForwardIterator1 , class ForwardIterator2 >
ForwardIterator1	search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >
ForwardIterator1	search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred)
template<class ForwardIterator1 , class ForwardIterator2 >
ForwardIterator1	find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >
ForwardIterator1	find_end (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred)
template<class ForwardIterator , class Size , class T >
ForwardIterator	search_n (ForwardIterator first, ForwardIterator last, Size count, T const &value)
template<class ForwardIterator , class Size , class T , class BinaryPredicate >
ForwardIterator	search_n (ForwardIterator first, ForwardIterator last, Size count, T const &value, BinaryPredicate pred)
template<class ForwardIterator1 , class ForwardIterator2 >
ForwardIterator1	find_first_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2)
template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >
ForwardIterator1	find_first_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred)
template<class T >
T const &	min (T const &a, T const &b)
template<class T , class Compare >
T const &	min (T const &a, T const &b, Compare comp)
template<class T >
T const &	max (T const &a, T const &b)
template<class T , class Compare >
T const &	max (T const &a, T const &b, Compare comp)
template<class ForwardIterator >
ForwardIterator	min_element (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator , class Compare >
ForwardIterator	min_element (ForwardIterator first, ForwardIterator last, Compare comp)
template<class ForwardIterator >
ForwardIterator	max_element (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator , class Compare >
ForwardIterator	max_element (ForwardIterator first, ForwardIterator last, Compare comp)
template<class InputIterator1 , class InputIterator2 >
bool	lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2)
template<class InputIterator1 , class InputIterator2 , class Compare >
bool	lexicographical_compare (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp)
template<class ForwardIterator , class T >
ForwardIterator	sequential_lower_bound (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
ForwardIterator	sequential_lower_bound (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
ForwardIterator	sequential_upper_bound (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
ForwardIterator	sequential_upper_bound (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
pair< ForwardIterator, ForwardIterator >	sequential_equal_range (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
pair< ForwardIterator, ForwardIterator >	sequential_equal_range (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
bool	sequential_search (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
bool	sequential_search (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
ForwardIterator	lower_bound (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
ForwardIterator	lower_bound (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
ForwardIterator	upper_bound (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
ForwardIterator	upper_bound (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
pair< ForwardIterator, ForwardIterator >	equal_range (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
pair< ForwardIterator, ForwardIterator >	equal_range (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class ForwardIterator , class T >
bool	binary_search (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class T , class Compare >
bool	binary_search (ForwardIterator first, ForwardIterator last, T const &value, Compare comp)
template<class T >
void	swap (T &a, T &b)
template<class ForwardIterator1 , class ForwardIterator2 >
void	iter_swap (ForwardIterator1 a, ForwardIterator2 b)
template<class ForwardIterator1 , class ForwardIterator2 >
ForwardIterator2	swap_ranges (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2)
template<class InputIterator , class OutputIterator >
OutputIterator	copy (InputIterator first, InputIterator last, OutputIterator dest)
template<class BIter1 , class BIter2 >
BIter2	copy_backward (BIter1 first, BIter1 last, BIter2 dest_end)
template<class InputIterator , class OutputIterator , class UnaryOperator >
OutputIterator	transform (InputIterator first, InputIterator last, OutputIterator result, UnaryOperator op)
template<class InputIterator1 , class InputIterator2 , class OutputIterator , class BinaryOperator >
OutputIterator	transform (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator result, BinaryOperator binary_op)
template<class ForwardIterator , class T >
void	replace (ForwardIterator first, ForwardIterator last, T const &old_value, T const &new_value)
template<class ForwardIterator , class Predicate , class T >
void	replace_if (ForwardIterator first, ForwardIterator last, Predicate pred, T const &new_value)
template<class InputIterator , class OutputIterator , class T >
OutputIterator	replace_copy (InputIterator first, InputIterator last, OutputIterator result, T const &old_value, T const &new_value)
template<class InputIterator , class OutputIterator , class Predicate , class T >
OutputIterator	replace_copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate pred, T const &new_value)
template<class ForwardIterator , class T >
void	fill (ForwardIterator first, ForwardIterator last, T const &value)
template<class OutputIterator , class Size , class T >
void	fill_n (OutputIterator first, Size n, T const &value)
template<class ForwardIterator , class Generator >
void	generate (ForwardIterator first, ForwardIterator last, Generator gen)
template<class OutputIterator , class Size , class Generator >
void	generate (OutputIterator first, Size n, Generator gen)
template<class ForwardIterator , class T >
ForwardIterator	remove (ForwardIterator first, ForwardIterator last, T const &value)
template<class ForwardIterator , class Predicate >
ForwardIterator	remove_if (ForwardIterator first, ForwardIterator last, Predicate pred)
template<class InputIterator , class OutputIterator , class T >
OutputIterator	remove_copy (InputIterator first, InputIterator last, OutputIterator result, T const &value)
template<class InputIterator , class OutputIterator , class Predicate >
OutputIterator	remove_copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate pred)
template<class ForwardIterator >
ForwardIterator	unique (ForwardIterator first, ForwardIterator last)
template<class ForwardIterator , class BinaryPredicate >
ForwardIterator	unique (ForwardIterator first, ForwardIterator last, BinaryPredicate pred)
template<class InputIterator , class OutputIterator >
OutputIterator	unique_copy (InputIterator first, InputIterator last, OutputIterator result)
template<class InputIterator , class OutputIterator , class BinaryPredicate >
OutputIterator	unique_copy (InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred)
template<class BidirectionalIterator >
void	reverse (BidirectionalIterator first, BidirectionalIterator last)
template<class BidirectionalIterator , class OutputIterator >
OutputIterator	reverse_copy (BidirectionalIterator first, BidirectionalIterator last, OutputIterator result)
template<class ForwardIterator >
void	rotate (ForwardIterator first, ForwardIterator middle, ForwardIterator last)
template<class ForwardIterator , class OutputIterator >
OutputIterator	rotate_copy (ForwardIterator first, ForwardIterator middle, ForwardIterator last, OutputIterator result)
template<class RandomAccessIterator , class RandomNumberGenerator >
void	random_shuffle (RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator &rand)
template<class BidirectionalIterator , class Predicate >
BidirectionalIterator	partition (BidirectionalIterator first, BidirectionalIterator last, Predicate pred)
template<class BidirectionalIterator >
BidirectionalIterator	__partition (BidirectionalIterator first, BidirectionalIterator pivot, BidirectionalIterator last)
template<class RandomAccessIterator >
RandomAccessIterator	__medianof3 (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator >
void	quickselect (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last)
template<class BidirectionalIterator , class Compare >
BidirectionalIterator	__partition (BidirectionalIterator first, BidirectionalIterator pivot, BidirectionalIterator last, Compare comp)
template<class RandomAccessIterator , class Compare >
RandomAccessIterator	__medianof3 (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator , class Compare >
void	quickselect (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	__push_heap (RandomAccessIterator const base, typename iterator_traits< RandomAccessIterator >::difference_type n)
template<class RandomAccessIterator , class Compare >
void	__push_heap (RandomAccessIterator const base, typename iterator_traits< RandomAccessIterator >::difference_type n, Compare const comp)
template<class RandomAccessIterator >
void	push_heap (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	__sift_down (RandomAccessIterator const base, typename iterator_traits< RandomAccessIterator >::difference_type start, typename iterator_traits< RandomAccessIterator >::difference_type const end)
template<class RandomAccessIterator , class Compare >
void	__sift_down (RandomAccessIterator const base, typename iterator_traits< RandomAccessIterator >::difference_type start, typename iterator_traits< RandomAccessIterator >::difference_type const end, Compare const comp)
template<class RandomAccessIterator >
void	__pop_heap (RandomAccessIterator const base, typename iterator_traits< RandomAccessIterator >::difference_type const n)
template<class RandomAccessIterator , class Compare >
void	__pop_heap (RandomAccessIterator const base, typename iterator_traits< RandomAccessIterator >::difference_type const n, Compare const comp)
template<class RandomAccessIterator >
void	pop_heap (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	pop_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	make_heap (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	sort_heap (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	sort_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	heap_sort (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	heap_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class InputIterator1 , class InputIterator2 , class OutputIterator >
OutputIterator	merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >
OutputIterator	merge (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp)
template<class BidirectionalIterator >
void	inplace_merge (BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last)
template<class BidirectionalIterator , class Compare >
void	inplace_merge (BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last, Compare comp)
template<class InputIterator1 , class InputIterator2 >
bool	includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2)
template<class InputIterator1 , class InputIterator2 , class Compare >
bool	includes (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp)
template<class InputIterator1 , class InputIterator2 , class OutputIterator >
OutputIterator	set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >
OutputIterator	set_union (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp)
template<class InputIterator1 , class InputIterator2 , class OutputIterator >
OutputIterator	set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >
OutputIterator	set_intersection (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp)
template<class InputIterator1 , class InputIterator2 , class OutputIterator >
OutputIterator	set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >
OutputIterator	set_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp)
template<class InputIterator1 , class InputIterator2 , class OutputIterator >
OutputIterator	set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result)
template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >
OutputIterator	set_symmetric_difference (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, Compare comp)
template<class RandomAccessIterator >
void	__heap_select (RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	__heap_select (RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	heap_select (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	heap_select (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	nth_element (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	nth_element (RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp)
template<class BidirectionalIterator , class T >
void	linear_insert (BidirectionalIterator first, BidirectionalIterator last, T val)
template<class BidirectionalIterator , class T , class Compare >
void	linear_insert (BidirectionalIterator first, BidirectionalIterator last, T val, Compare comp)
template<class BidirectionalIterator >
void	insertion_sort (BidirectionalIterator first, BidirectionalIterator last)
template<class BidirectionalIterator , class Compare >
void	insertion_sort (BidirectionalIterator first, BidirectionalIterator last, Compare comp)
template<class RandomAccessIterator >
void	selection_partial_sort (RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	selection_partial_sort (RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	stable_sort (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	sort (RandomAccessIterator first, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
template<class RandomAccessIterator >
void	partial_sort (RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last)
template<class RandomAccessIterator , class Compare >
void	partial_sort (RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp)
template<class InputIterator , class RandomAccessIterator >
RandomAccessIterator	partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last)
template<class InputIterator , class RandomAccessIterator , class Compare >
RandomAccessIterator	partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp)
template<class InputIterator , class Distance >
void	__advance (InputIterator &i, Distance n, input_iterator_tag)
template<class RandomAccessIterator , class Distance >
void	__advance (RandomAccessIterator &i, Distance n, random_access_iterator_tag)
template<class InputIterator , class Distance >
void	advance (InputIterator &i, Distance n)
template<class InputIterator >
iterator_traits< InputIterator > ::difference_type	distance (InputIterator first, InputIterator last, input_iterator_tag)
template<class RandomAccessIterator >
iterator_traits < RandomAccessIterator > ::difference_type	distance (RandomAccessIterator first, RandomAccessIterator last, random_access_iterator_tag)
template<class InputIterator >
iterator_traits< InputIterator > ::difference_type	distance (InputIterator first, InputIterator last)
template<typename Value_P >
list_iterator< Value_P > ::difference_type	operator- (const list_iterator< Value_P > &lhs, const list_iterator< Value_P > &rhs)
	calculate distance between two list iterators
char *	mystrncpy (char target1, const char source1, int no)
template<class T1 , class T2 >
pair< T1, T2 >	make_pair (T1 first, T2 second)
Comparison
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
bool	operator== (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
bool	operator== (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
bool	operator!= (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
bool	operator!= (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
normal_iterator< _OsModel, _Iterator_L, _Container > ::difference_type	operator- (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
normal_iterator< _OsModel, _Iterator, _Container > ::difference_type	operator- (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
normal_iterator< _OsModel, _Iterator_L, _Container > ::difference_type	operator+ (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
normal_iterator< _OsModel, _Iterator, _Container > ::difference_type	operator+ (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
bool	operator< (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
bool	operator< (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
bool	operator> (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
bool	operator> (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
bool	operator<= (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
bool	operator<= (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >
bool	operator>= (const normal_iterator< _OsModel, _Iterator_L, _Container > &lhs, const normal_iterator< _OsModel, _Iterator_R, _Container > &rhs)
template<typename _OsModel , typename _Iterator , typename _Container >
bool	operator>= (const normal_iterator< _OsModel, _Iterator, _Container > &lhs, const normal_iterator< _OsModel, _Iterator, _Container > &rhs)
Variables
contiki_radio_fp	contiki_internal_radio_callback = 0
struct abc_conn	contiki_radio_conn
static const int	MAX_REGISTERED_RECEIVERS = 10
static contiki_radio_delegate_t	receivers [MAX_REGISTERED_RECEIVERS]
static struct abc_callbacks	abc_call = { abc_recv }
static const int	MAX_REGISTERED_TIMER = 10
timer_item	timer_item_
timer_item	timer_items [MAX_REGISTERED_TIMER]
process	timer_process
Component *	static_comp
LorienOsModel	lorien_os
OsaOs	osa_os
ShawnOs	shawn_os
static Params	params
Params	param
const int	LOCALIZATION_SIMPLE_MATRIX_MAX_VECSIZE = 100
const double	UNKNOWN_DISTANCE = DBL_MIN
const Vec< double >	UNKNOWN_POSITION = Vec<double>( DBL_MIN, DBL_MIN, DBL_MIN )
const double	UNKNOWN_ANGLE = DBL_MIN
const double	UNKNOWN_AVG_HOP_DIST = DBL_MAX
const int	UNKNOWN_HOP_CNT = INT_MAX
const char *	SEL_NODE_TAG_NAME = "LOCALIZATION_SELECTED_NODE_TAG"
contiki_byte_uart_fp	contiki_internal_byte_uart_callback = 0
contiki_uart_fp	contiki_internal_uart_callback = 0
unsigned char	base64Table [64]
static const int	MAX_MESSAGE_LENGTH = 57
static int	message_counter = 0
trisos_radio_fp	trisos_internal_radio_callback = 0
static uint16_t	GATEWAY_ADDRESS
static uint16_t	nTxPacket
	Unkown until the right msh is received.
static uint16_t	nRxPacketT1
	Unkown until the right msh is received.
static uint16_t	nRxPacketT2
	Unkown until the right msh is received.
static uint16_t	nRxPacketT3
	Unkown until the right msh is received.
static uint16_t	nDropPackets
	Unkown until the right msh is received.
static uint8_t	payload [116]
	Unkown until the right msh is received.
static uint16_t	vneighbors [8]
static uint8_t	vneighbors_idx
euclidean module parameters
const char *	EUCL_COL_CHECK_STD [] = { "lax", "strict", "one" }
const char *	EUCL_COL_CHECK_NV [] = { "lax", "strict", "one" }
const char *	EUCL_COL_CHECK_CN [] = { "lax", "strict", "one" }
const char *	EUCL_ALGO [] = { "normal", "opt" }
const char *	EUCL_VOTE [] = { "nv", "cn", "nvcn", "cnnv" }

Detailed Description

AES Algorithm.

An implementation of the AES Algorithm.

Typedef Documentation

typedef contiki_byte_uart_delegate_t wiselib::byte_uart_delegate_t

typedef delegate1<int, uint8_t> wiselib::contiki_byte_uart_delegate_t

typedef int(* wiselib::contiki_byte_uart_fp)(uint8_t)

typedef delegate3<void, uint16_t, uint8_t, uint8_t*> wiselib::contiki_radio_delegate_t

typedef void(* wiselib::contiki_radio_fp)(struct abc_conn *c)

typedef delegate1<void, void*> wiselib::contiki_timer_delegate_t

typedef delegate2<void, uint8_t, uint8_t*> wiselib::contiki_uart_delegate_t

typedef void(* wiselib::contiki_uart_fp)(uint8_t, uint8_t *)

typedef struct Curve wiselib::Curve

typedef struct DataBlock wiselib::DataBlock

typedef struct Elt wiselib::Elt

typedef delegate3<void, uint8_t, uint8_t, char*> wiselib::feuerwhere_radio_delegate_t

typedef delegate1<void, void*> wiselib::feuerwhere_timer_delegate_t

typedef struct wiselib::sk wiselib::group_key

typedef struct HKCelement_t wiselib::HKCelement_t

typedef int16_t wiselib::index_t

typedef int16 wiselib::int16_t

typedef int32 wiselib::int32_t

typedef int64 wiselib::int64_t

typedef int8 wiselib::int8_t

typedef struct wiselib::p wiselib::key

typedef struct wiselib::ki wiselib::key_info

typedef int wiselib::list_size_t

type for list size

typedef delegate3<void, TNodeID_Int, uint8_t, uint8_t*> wiselib::lorien_radio_delegate_t

typedef struct wiselib::lxs wiselib::LXState

typedef uint32_t wiselib::NN_DIGIT

typedef uint64_t wiselib::NN_DOUBLE_DIGIT

typedef uint8_t wiselib::NN_UINT

typedef uint16_t wiselib::NN_UINT2

typedef wiselib::OSMODEL wiselib::Os

typedef delegate3<void, TNodeID_Int, uint8_t, uint8_t*> wiselib::osa_radio_delegate_t

typedef struct Params wiselib::Params

typedef struct Point wiselib::Point

typedef struct PrivKey wiselib::PrivKey

typedef struct PubKey wiselib::PubKey

typedef feuerwhere_radio_delegate_t wiselib::radio_delegate_t

typedef Os::Rand wiselib::Random

typedef delegate3<void, netaddr_t, uint8_t, uint8_t*> wiselib::scw_radio_delegate_t

typedef delegate1<void, void*> wiselib::scw_timer_delegate_t

typedef struct wiselib::SHA1Context wiselib::SHA1Context

typedef uint8_t wiselib::state_t

typedef unsigned int wiselib::TNodeID_Int

typedef delegate3<void, uint16_t, uint8_t, uint8_t*> wiselib::trisos_radio_delegate_t

typedef void(* wiselib::trisos_radio_fp)(uint8_t data_length, uint8_t *data)

typedef delegate1<void, void*> wiselib::trisos_timer_delegate_t

typedef struct wiselib::_TrRecpList wiselib::TrRecpList

typedef contiki_uart_delegate_t wiselib::uart_delegate_t

typedef uint16 wiselib::uint16_t

typedef uint32 wiselib::uint32_t

typedef uint64 wiselib::uint64_t

typedef uint8 wiselib::uint8_t

typedef uint8_t wiselib::word_t

Enumeration Type Documentation

enum wiselib::AODVRoutingMsgIds

Enumerator:

RREQ	Msg type for flooding network.
RREP	Msg type for returning found path.
ERR	Msg type for routing messages.
DATA
HELO

enum wiselib::BasicTopologyMsgIds

Enumerator:

BasicTopologyBroadcastMsgId

Msg type for flooding network.

enum wiselib::ClusterIds

Enumerator:

UNKNOWN_CLUSTER_HEAD

enum wiselib::DsdvRoutingMsgIds

Enumerator:

DsdvBroadcastMsgId	Msg type for flooding network.
DsdvRoutingMsgId	Msg type for routing messages.

enum wiselib::DsrRoutingMsgIds

Enumerator:

DsrRouteRequestMsgId	Msg type for flooding network.
DsrRouteReplyMsgId	Msg type for returning found path.
DsrRoutingMsgId	Msg type for routing messages.

enum wiselib::DYMORoutingMsgIds

Enumerator:

DYMO_RREQ
DYMO_RREP
DYMO_ERR
DYMO_DATA

enum wiselib::Endianness

Enumerator:

WISELIB_LITTLE_ENDIAN
WISELIB_BIG_ENDIAN

enum wiselib::EventIds

Enumerator:

CLUSTER_HEAD_CHANGED
NODE_JOINED
NODE_LEFT
CLUSTER_FORMED
GATEWAY_NODE

enum wiselib::KeylevelsMessageTypes

Enumerator:

KEY_ACK
GROUP_KEY
NEIGHBORHOOD_SEEK
NEIGHBORHOOD_ACK
TTL_MESSAGE
KEY_ACK
GROUP_KEY
NEIGHBORHOOD_SEEK
NEIGHBORHOOD_ACK
TTL_MESSAGE

enum wiselib::KeylevelsMessageTypes

Enumerator:

KEY_ACK
GROUP_KEY
NEIGHBORHOOD_SEEK
NEIGHBORHOOD_ACK
TTL_MESSAGE
KEY_ACK
GROUP_KEY
NEIGHBORHOOD_SEEK
NEIGHBORHOOD_ACK
TTL_MESSAGE

enum wiselib::KNeighTopologyMsgIds

Enumerator:

KNeighBroadcastMsgId	Msg type for flooding network.
KNeighListMsgId	Msg type for routing messages.

enum wiselib::LaterationType

Enumerator:

lat_anchors	only valid anchors
lat_confident	only confident neighbors

enum wiselib::message_types

Enumerator:

JUDGE_START
NODE_START
BROAD_JUDGE
REQUEST_COLOR
ASSIGN_COLOR
COLOR_ASSIGNED
REASSIGN_COLOR
ASK_PERMISSION
GIVE_PERMISSION
DECL_PERMISSION
COLOR_NOT_ASSIGNED
TAKE_TURN
ASK_JUDGE
ASK_COLOR
REPLY_COLOR
FINAL_CHECK
CHECK_OK
CHECK_NOT_OK
CENT_END
ALL_END

enum wiselib::ms_types

Enumerator:

NODE_STARTED
REP_CHANGE
REP_SAT
REP_FBID
REQ_COLOR
REP_COLOR

enum wiselib::msg_ids

Enumerator:

CLRADIO_MSG
JOIN
REJOIN
RESUME
CONVERGECAST
ATTRIBUTE
FLOOD
REFORM
INFORM
JOIN_ACCEPT
NEIGHBOR_DISCOVERY
NEIGHBOR_REPLY
JOIN_REQUEST

enum wiselib::node_type

Enumerator:

UNCLUSTERED
SIMPLE
HEAD
GATEWAY

enum wiselib::OlsrRoutingMsgIds

Enumerator:

HELLO
TC
DATA

enum wiselib::SensorEncodings

Enumerator:

UNKNOWN_ENCODING
BOOL
UINT8
INT8
UINT16
INT16
UINT32
INT32
UINT64
INT64
STRING
DOUBLE

enum wiselib::SequentialTryMsgIds

Enumerator:

SequentialTryPingMsgId
SequentialTryPongMsgId

enum wiselib::ToraRoutingMsgIds

Enumerator:

ToraBroadcastMsgId	Msg type for flooding network.
QRY	Msg type for routing messages.
UPD
CLR
DATA

enum wiselib::XTCTopologyMsgIds

Enumerator:

XTCBroadcastMsgId	Msg type for flooding network.
XTCOrderMsgId	Msg type for routing messages.

Function Documentation

template<class InputIterator , class Distance >

void wiselib::__advance	(	InputIterator &	i,
		Distance	n,
		input_iterator_tag
	)

template<class RandomAccessIterator , class Distance >

void wiselib::__advance	(	RandomAccessIterator &	i,
		Distance	n,
		random_access_iterator_tag
	)

template<class RandomAccessIterator >

void wiselib::__heap_select	(	RandomAccessIterator	first,
		RandomAccessIterator	middle,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::__heap_select	(	RandomAccessIterator	first,
		RandomAccessIterator	middle,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator , class Compare >

RandomAccessIterator wiselib::__medianof3	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

RandomAccessIterator wiselib::__medianof3	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class BidirectionalIterator >

BidirectionalIterator wiselib::__partition	(	BidirectionalIterator	first,
		BidirectionalIterator	pivot,
		BidirectionalIterator	last
	)

template<class BidirectionalIterator , class Compare >

BidirectionalIterator wiselib::__partition	(	BidirectionalIterator	first,
		BidirectionalIterator	pivot,
		BidirectionalIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::__pop_heap	(	RandomAccessIterator const	base,
		typename iterator_traits< RandomAccessIterator >::difference_type const	n
	)

template<class RandomAccessIterator , class Compare >

void wiselib::__pop_heap	(	RandomAccessIterator const	base,
		typename iterator_traits< RandomAccessIterator >::difference_type const	n,
		Compare const	comp
	)

template<class RandomAccessIterator >

void wiselib::__push_heap	(	RandomAccessIterator const	base,
		typename iterator_traits< RandomAccessIterator >::difference_type	n
	)

template<class RandomAccessIterator , class Compare >

void wiselib::__push_heap	(	RandomAccessIterator const	base,
		typename iterator_traits< RandomAccessIterator >::difference_type	n,
		Compare const	comp
	)

template<class RandomAccessIterator >

void wiselib::__sift_down	(	RandomAccessIterator const	base,
		typename iterator_traits< RandomAccessIterator >::difference_type	start,
		typename iterator_traits< RandomAccessIterator >::difference_type const	end
	)

template<class RandomAccessIterator , class Compare >

void wiselib::__sift_down	(	RandomAccessIterator const	base,
		typename iterator_traits< RandomAccessIterator >::difference_type	start,
		typename iterator_traits< RandomAccessIterator >::difference_type const	end,
		Compare const	comp
	)

static void wiselib::abc_recv ( struct abc_conn * c ) [static]

template<class ForwardIterator >

ForwardIterator wiselib::adjacent_find	(	ForwardIterator	first,
		ForwardIterator	last
	)

template<class ForwardIterator , class BinaryPredicate >

ForwardIterator wiselib::adjacent_find	(	ForwardIterator	first,
		ForwardIterator	last,
		BinaryPredicate	pred
	)

template<class InputIterator , class Distance >

void wiselib::advance	(	InputIterator &	i,
		Distance	n
	)

template<typename Arithmatic_P >

Arithmatic_P wiselib::angle_vec ( const Vec< Arithmatic_P > & vec ) [static]

This method computes the angle of a vector in respect to the x-axis.

Parameters:

shawn::Vec<Arithmatic_P>& Vector

Returns:: angle

template<class ForwardIterator , class T , class Compare >

bool wiselib::binary_search	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<class ForwardIterator , class T >

bool wiselib::binary_search	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<typename OsModel_P , typename NeighborInfoList , typename Arithmatic_P >

bool wiselib::check_residue	(	const NeighborInfoList &	neighbors,
		const Vec< Arithmatic_P > &	est_pos,
		const LaterationType &	lat_type,
		Arithmatic_P	comm_range
	)

This Method checks, whether an estimated position is accepted or not.

It uses the distance residues between given ones and estimated. Formula looks like following:

$residue = \frac{\sum^n_{i=1}\sqrt{(x_i-x)^2+(y_i-y)^2}-d_i}{n}$

Parameters:

NeighborInfoList	Neighbors, for which sanity check is started
Vec	estimated position
LaterationType	Type of lateration to decide, whether use weights in calculation or not
Arithmatic_P	Simulations communication range

Returns:: true, if estimated position is accepted. false otherwise

See also:: est_pos_lateration(), est_pos_min_max(), collect_neighbors(), LaterationType

template<typename OsModel_P , typename Neighborhood , typename NeighborInfoList , typename Arithmatic_P >

void wiselib::collect_neighbors	(	Neighborhood &	nbrhood,
		const LaterationType &	lat_type,
		NeighborInfoList &	nbrs
	)

This method collects different types of neighbors in a NeighborInfoList used in est_pos_lateration() and check_residue().

The type of neighbors is given by the lateration type.

Parameters:

LocalizationNeighborhood	Used neighborhood
LaterationType	Type of resulting neighbors, e.g. anchors or confident neighbors
NeighborInfoList	Resulting list of neighbors

See also:: est_pos_lateration(), check_residue(), LaterationType

template<typename Arithmatic_P >

Arithmatic_P wiselib::collinear_measure	(	Arithmatic_P	a,
		Arithmatic_P	b,
		Arithmatic_P	c,
		Arithmatic_P	error = `0`
	)		`[static]`

To decide, whether a triangle is collinear or not, the sum of the two smallest sides minus the largest side is formed.

To take account ranging errors, additionally the largest side is multiplied by 1 plus a threshold, which is given as the fourth parameter.

Resulting formula looks like following:

$a + b - ( 1 + threshold ) * c$

The greater the resulting measure is, the fewer collinear the triangle is.

Parameters:

Arithmatic_P	length of side of a triangle
Arithmatic_P	length of side of a triangle
Arithmatic_P	length of side of a triangle
Arithmatic_P	above mentioned threshold

Returns:: Measure of collinearity of the three given distances with respect to the given error

See also:: is_collinear()

template<typename Arithmatic_P >

bool wiselib::compute_basis_coords	(	Arithmatic_P	src_p,
		Arithmatic_P	src_q,
		Arithmatic_P	p_q,
		Vec< Arithmatic_P > &	pos_p,
		Vec< Arithmatic_P > &	pos_q
	)		`[static]`

This method computes relative coordinates of two nodes given the distances from source to the two nodes and distance between latter.

The coordinates are relative to the source position (0,0,0).

Till now, there is just 2D supported.

Parameters:

Arithmatic_P	distance source - first node p
Arithmatic_P	distance source - second node q
Arithmatic_P	distance first node p - second node q
Vec<Arithmatic_P>&	coordinate of first node p
Vec<Arithmatic_P>&	coordinate of second node q

Returns:: true, if computation succeedes. false otherwise.

template<typename Arithmatic_P >

bool wiselib::compute_rel_coord_triangulisation	(	Arithmatic_P	src_p,
		Arithmatic_P	src_q,
		Arithmatic_P	src_j,
		Arithmatic_P	p_j,
		Arithmatic_P	q_j,
		Arithmatic_P	p_q,
		Vec< Arithmatic_P > &	pos_j,
		Arithmatic_P	epsilon
	)		`[static]`

This method computes the relative coordinate of a node j depending on the distances to two others p and q.

Up to now, there is just 2D supported.

Parameters:

Arithmatic_P	distance source - first node p
Arithmatic_P	distance source - second node q
Arithmatic_P	distance source - third node j
Arithmatic_P	distance first node p - third node j
Arithmatic_P	distance second node q - third node j
Arithmatic_P	distance first node p - second node q
Vec<Arithmatic_P>&	coordinate of the node j
Arithmatic_P	epsilon

Returns:: true, if computation succeedes. false otherwise.

int wiselib::construct ( Component * comp )

int wiselib::contiki_byte_uart_add_receiver ( contiki_byte_uart_delegate_t & d )

void wiselib::contiki_byte_uart_del_receiver ( int idx )

int wiselib::contiki_byte_uart_notify_receivers ( uint8_t data )

void wiselib::contiki_notify_receivers ( struct abc_conn * c )

int wiselib::contiki_radio_add_receiver ( contiki_radio_delegate_t & d )

void wiselib::contiki_radio_del_receiver ( int idx )

int wiselib::contiki_uart_add_receiver ( contiki_uart_delegate_t & d )

void wiselib::contiki_uart_del_receiver ( int idx )

void wiselib::contiki_uart_notify_receivers	(	uint8_t	len,
		uint8_t *	data
	)

template<class InputIterator , class OutputIterator >

OutputIterator wiselib::copy	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	dest
	)

template<class BIter1 , class BIter2 >

BIter2 wiselib::copy_backward	(	BIter1	first,
		BIter1	last,
		BIter2	dest_end
	)

template<class InputIterator , class T >

iterator_traits<InputIterator>::difference_type wiselib::count	(	InputIterator	first,
		InputIterator	last,
		T const &	value
	)

template<class InputIterator , class Predicate >

iterator_traits<InputIterator>::difference_type wiselib::count_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)

unsigned char wiselib::decodeBase64 ( unsigned char * b64 )

int wiselib::destruct ( Component * comp )

static int wiselib::disable ( Component * comp ) [static]

template<typename Float , typename block_data , typename Os >

Float wiselib::dist	(	const PositionType< Float, block_data, Os >	p1,
		const PositionType< Float, block_data, Os >	p2
	)

template<class InputIterator >

iterator_traits<InputIterator>::difference_type wiselib::distance	(	InputIterator	first,
		InputIterator	last,
		input_iterator_tag
	)

template<class RandomAccessIterator >

iterator_traits<RandomAccessIterator>::difference_type wiselib::distance	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		random_access_iterator_tag
	)

template<class InputIterator >

iterator_traits<InputIterator>::difference_type wiselib::distance	(	InputIterator	first,
		InputIterator	last
	)

template<typename Float , typename block_data , typename Os >

Float wiselib::distsq	(	const PositionType< Float, block_data, Os >	p1,
		const PositionType< Float, block_data, Os >	p2
	)

static int wiselib::enable ( Component * comp ) [static]

void wiselib::encodeBase64	(	unsigned char	b,
		unsigned char *	result
	)

template<class InputIterator1 , class InputIterator2 >

bool wiselib::equal	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2
	)

template<class InputIterator1 , class InputIterator2 , class BinaryPredicate >

bool wiselib::equal	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		BinaryPredicate	pred
	)

template<class ForwardIterator , class T >

pair<ForwardIterator, ForwardIterator> wiselib::equal_range	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class ForwardIterator , class T , class Compare >

pair<ForwardIterator, ForwardIterator> wiselib::equal_range	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<typename OsModel_P , typename NeighborInfoList , typename Arithmatic_P >

bool wiselib::est_pos_lateration	(	const NeighborInfoList &	neighbors,
		Vec< Arithmatic_P > &	pos,
		const LaterationType &	lat_type,
		bool	use_pos
	)

Position estimation with distance to anchors and their positions.

This method uses lateration for position estimation. Main idea is to solve a system of equations, using here a least squares approach.

Cause of different requirements, there is a chance to use standard or weighted least squares approach.

Parameters:

NeighborInfoList	Neighbors, for which above mentioned least squares approach is started
Vec	New, estimated position
LaterationType	Type of lateration to decide, whether using standard or weighted least squares approach
bool	if `true`, given position is used in least squares approach

Returns:: true, if estimation succeeded. false otherwise

See also:: est_pos_min_max(), collect_neighbors(), LaterationType

template<typename OsModel_P , typename NeighborInfoList , typename Arithmatic_P >

bool wiselib::est_pos_min_max	(	const NeighborInfoList &	neighbors,
		Vec< Arithmatic_P > &	pos
	)

Position estimation with distance to anchors and their positions.

Main idea is set a bounding box, defined by position and distance, around each anchor. The estimated position is the center of the resulting intersection box.

Parameters:

NeighborInfoList	Neighbors, for which above mentioned bounding boxes are builded
Vec	New, estimated position

Returns:: true, if estimation succeeded. false otherwise

See also:: est_pos_lateration()

void wiselib::feuerwhere_notify_receivers ( struct abc_conn * c )

int wiselib::feuerwhere_radio_add_receiver ( feuerwhere_radio_delegate_t & d )

void wiselib::feuerwhere_radio_del_receiver ( int idx )

void wiselib::feuerwhere_timer_thread ( void )

Describes a message object which can be sent between threads.

User can set type and one of content.ptr and content.value. (content is a union) The meaning of type and the content fields is totally up to the user, the corresponding fields are never read by the kernel.

printf ("In timer thread for %s\n",(char*)t->ptr );

template<class ForwardIterator , class T >

void wiselib::fill	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class OutputIterator , class Size , class T >

void wiselib::fill_n	(	OutputIterator	first,
		Size	n,
		T const &	value
	)

template<class InputIterator , class T >

InputIterator wiselib::find	(	InputIterator	first,
		InputIterator	last,
		T const &	value
	)

template<class ForwardIterator1 , class ForwardIterator2 >

ForwardIterator1 wiselib::find_end	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2
	)

template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >

ForwardIterator1 wiselib::find_end	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2,
		BinaryPredicate	pred
	)

template<class ForwardIterator1 , class ForwardIterator2 >

ForwardIterator1 wiselib::find_first_of	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2
	)

template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >

ForwardIterator1 wiselib::find_first_of	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2,
		BinaryPredicate	pred
	)

template<class InputIterator , class Predicate >

InputIterator wiselib::find_if	(	InputIterator	first,
		InputIterator	last,
		Predicate	pred
	)

template<class InputIterator , class Function >

Function wiselib::for_each	(	InputIterator	first,
		InputIterator	last,
		Function	f
	)

template<class ForwardIterator , class Generator >

void wiselib::generate	(	ForwardIterator	first,
		ForwardIterator	last,
		Generator	gen
	)

template<class OutputIterator , class Size , class Generator >

void wiselib::generate	(	OutputIterator	first,
		Size	n,
		Generator	gen
	)

FeuerwhereTimerItem * wiselib::get_feuerwhere_timer_item ( void )

static unsigned int wiselib::get_id ( Component * comp ) [static]

static const char * wiselib::get_id_type ( Component * comp ) [static]

timer_item * wiselib::get_timer_item_ref ( void )

const TriSOSOsModel& wiselib::get_trisos_os_model ( )

static int wiselib::getIndexOf ( unsigned char c ) [static]

template<class RandomAccessIterator , class Compare >

void wiselib::heap_select	(	RandomAccessIterator	first,
		RandomAccessIterator	nth,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::heap_select	(	RandomAccessIterator	first,
		RandomAccessIterator	nth,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator >

void wiselib::heap_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::heap_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 >

bool wiselib::includes	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2
	)

template<class InputIterator1 , class InputIterator2 , class Compare >

bool wiselib::includes	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		Compare	comp
	)

void wiselib::init_contiki_byte_uart ( void )

void wiselib::init_contiki_radio ( void )

void wiselib::init_contiki_timer ( void )

void wiselib::init_contiki_uart ( void )

void wiselib::init_feuerwhere_cc1100_radio ( void )

void wiselib::init_timer ( void )

void wiselib::init_trisos_radio ( void )

void wiselib::init_trisos_timer ( void )

template<class BidirectionalIterator , class Compare >

void wiselib::inplace_merge	(	BidirectionalIterator	first,
		BidirectionalIterator	middle,
		BidirectionalIterator	last,
		Compare	comp
	)

template<class BidirectionalIterator >

void wiselib::inplace_merge	(	BidirectionalIterator	first,
		BidirectionalIterator	middle,
		BidirectionalIterator	last
	)

template<class BidirectionalIterator , class Compare >

void wiselib::insertion_sort	(	BidirectionalIterator	first,
		BidirectionalIterator	last,
		Compare	comp
	)

template<class BidirectionalIterator >

void wiselib::insertion_sort	(	BidirectionalIterator	first,
		BidirectionalIterator	last
	)

template<typename Arithmatic_P >

bool wiselib::is_collinear	(	Arithmatic_P	a,
		Arithmatic_P	b,
		Arithmatic_P	c,
		Arithmatic_P	error = `0`
	)		`[inline, static]`

This methode forms the collinear_measure() and decides, whether the triangle is collinear or not.

Parameters:

Arithmatic_P	length of side of a triangle
Arithmatic_P	length of side of a triangle
Arithmatic_P	length of side of a triangle
Arithmatic_P	above mentioned threshold

Returns:: true, if collinear_measure() is less or equal 0. false otherwise.

See also:: collinear_measure()

template<class ForwardIterator1 , class ForwardIterator2 >

void wiselib::iter_swap	(	ForwardIterator1	a,
		ForwardIterator2	b
	)

template<class InputIterator1 , class InputIterator2 , class Compare >

bool wiselib::lexicographical_compare	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 >

bool wiselib::lexicographical_compare	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2
	)

template<class BidirectionalIterator , class T , class Compare >

void wiselib::linear_insert	(	BidirectionalIterator	first,
		BidirectionalIterator	last,
		T	val,
		Compare	comp
	)

template<class BidirectionalIterator , class T >

void wiselib::linear_insert	(	BidirectionalIterator	first,
		BidirectionalIterator	last,
		T	val
	)

template<class ForwardIterator , class T >

ForwardIterator wiselib::lower_bound	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class ForwardIterator , class T , class Compare >

ForwardIterator wiselib::lower_bound	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::make_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::make_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<typename T1 , typename T2 >

wiselib::pair<T1, T2> wiselib::make_pair	(	const T1 &	first,
		const T2 &	second
	)

template<class T1 , class T2 >

pair<T1, T2> wiselib::make_pair	(	T1	first,
		T2	second
	)

template<class T >

T const& wiselib::max	(	T const &	a,
		T const &	b
	)

template<class T , class Compare >

T const& wiselib::max	(	T const &	a,
		T const &	b,
		Compare	comp
	)

template<class ForwardIterator >

ForwardIterator wiselib::max_element	(	ForwardIterator	first,
		ForwardIterator	last
	)

template<class ForwardIterator , class Compare >

ForwardIterator wiselib::max_element	(	ForwardIterator	first,
		ForwardIterator	last,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >

OutputIterator wiselib::merge	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator >

OutputIterator wiselib::merge	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result
	)

template<class T >

T const& wiselib::min	(	T const &	a,
		T const &	b
	)

template<class T , class Compare >

T const& wiselib::min	(	T const &	a,
		T const &	b,
		Compare	comp
	)

template<class ForwardIterator >

ForwardIterator wiselib::min_element	(	ForwardIterator	first,
		ForwardIterator	last
	)

template<class ForwardIterator , class Compare >

ForwardIterator wiselib::min_element	(	ForwardIterator	first,
		ForwardIterator	last,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 >

pair<InputIterator1, InputIterator2> wiselib::mismatch	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2
	)

template<class InputIterator1 , class InputIterator2 , class BinaryPredicate >

pair<InputIterator1, InputIterator2> wiselib::mismatch	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		BinaryPredicate	pred
	)

char* wiselib::mystrncpy	(	char *	target1,
		const char *	source1,
		int	no
	)

template<typename Arithmatic_P >

Arithmatic_P wiselib::normalize_angle ( Arithmatic_P angle ) [static]

This method sets the angle between 0 and 2*PI.

Parameters:

doublke angle

Returns:: angle

template<class RandomAccessIterator >

void wiselib::nth_element	(	RandomAccessIterator	first,
		RandomAccessIterator	nth,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::nth_element	(	RandomAccessIterator	first,
		RandomAccessIterator	nth,
		RandomAccessIterator	last,
		Compare	comp
	)

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

bool wiselib::operator!=	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

bool wiselib::operator!=	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

normal_iterator< _OsModel, _Iterator_L, _Container >::difference_type wiselib::operator+	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

normal_iterator< _OsModel, _Iterator, _Container >::difference_type wiselib::operator+	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

normal_iterator< _OsModel, _Iterator_L, _Container >::difference_type wiselib::operator-	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

normal_iterator< _OsModel, _Iterator, _Container >::difference_type wiselib::operator-	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<typename Value_P >

list_iterator<Value_P>::difference_type wiselib::operator-	(	const list_iterator< Value_P > &	lhs,
		const list_iterator< Value_P > &	rhs
	)		`[inline]`

calculate distance between two list iterators

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

bool wiselib::operator<	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

bool wiselib::operator<	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<class First , class Second >

bool wiselib::operator<	(	const pair< First, Second > &	p1,
		const pair< First, Second > &	p2
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

bool wiselib::operator<=	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

bool wiselib::operator<=	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

bool wiselib::operator==	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

bool wiselib::operator==	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

bool wiselib::operator>	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

bool wiselib::operator>	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator_L , typename _Iterator_R , typename _Container >

bool wiselib::operator>=	(	const normal_iterator< _OsModel, _Iterator_L, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator_R, _Container > &	rhs
	)		`[inline]`

template<typename _OsModel , typename _Iterator , typename _Container >

bool wiselib::operator>=	(	const normal_iterator< _OsModel, _Iterator, _Container > &	lhs,
		const normal_iterator< _OsModel, _Iterator, _Container > &	rhs
	)		`[inline]`

static int wiselib::osa_recv	(	Component *	comp,
		unsigned char *	data,
		size_t	len,
		unsigned int	from_id,
		unsigned int	port
	)		`[static]`

template<class RandomAccessIterator >

void wiselib::partial_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	middle,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::partial_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	middle,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class InputIterator , class RandomAccessIterator , class Compare >

RandomAccessIterator wiselib::partial_sort_copy	(	InputIterator	first,
		InputIterator	last,
		RandomAccessIterator	result_first,
		RandomAccessIterator	result_last,
		Compare	comp
	)

template<class InputIterator , class RandomAccessIterator >

RandomAccessIterator wiselib::partial_sort_copy	(	InputIterator	first,
		InputIterator	last,
		RandomAccessIterator	result_first,
		RandomAccessIterator	result_last
	)

template<class BidirectionalIterator , class Predicate >

BidirectionalIterator wiselib::partition	(	BidirectionalIterator	first,
		BidirectionalIterator	last,
		Predicate	pred
	)

template<class RandomAccessIterator >

void wiselib::pop_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::pop_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

wiselib::PROCESS	(	timer_process	,
		"timer process"
	)

wiselib::PROCESS	(	contiki_byte_uart_process	,
		"Contiki Byte Based Uart"
	)

wiselib::PROCESS	(	contiki_radio_process	,
		"Contiki Radio"
	)

wiselib::PROCESS	(	contiki_uart_process	,
		"Contiki Uart"
	)

wiselib::PROCESS_THREAD	(	contiki_byte_uart_process	,
		ev	,
		data
	)

wiselib::PROCESS_THREAD	(	timer_process	,
		ev	,
		data
	)

wiselib::PROCESS_THREAD	(	contiki_uart_process	,
		ev	,
		data
	)

wiselib::PROCESS_THREAD	(	contiki_radio_process	,
		ev	,
		data
	)

static void wiselib::protocol_handler	(	void *	msg,
		int	msg_size,
		packet_info_t *	packet_info
	)		`[static]`

template<class RandomAccessIterator , class Compare >

void wiselib::push_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::push_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::quickselect	(	RandomAccessIterator	first,
		RandomAccessIterator	nth,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::quickselect	(	RandomAccessIterator	first,
		RandomAccessIterator	nth,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class RandomNumberGenerator >

void wiselib::random_shuffle	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		RandomNumberGenerator &	rand
	)

template<typename OsModel_P , typename BlockData_P , typename Type_P >

Type_P wiselib::read ( BlockData_P * target ) [inline]

template<typename OsModel_P , typename BlockData_P , typename Type_P >

void wiselib::read	(	BlockData_P *	target,
		Type_P &	value
	)		`[inline]`

static int wiselib::reg_recv_callback	(	Component *	comp,
		Component *	r,
		unsigned int	port
	)		`[static]`

template<class ForwardIterator , class T >

ForwardIterator wiselib::remove	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class InputIterator , class OutputIterator , class T >

OutputIterator wiselib::remove_copy	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	result,
		T const &	value
	)

template<class InputIterator , class OutputIterator , class Predicate >

OutputIterator wiselib::remove_copy_if	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	result,
		Predicate	pred
	)

template<class ForwardIterator , class Predicate >

ForwardIterator wiselib::remove_if	(	ForwardIterator	first,
		ForwardIterator	last,
		Predicate	pred
	)

template<class ForwardIterator , class T >

void wiselib::replace	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	old_value,
		T const &	new_value
	)

template<class InputIterator , class OutputIterator , class T >

OutputIterator wiselib::replace_copy	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	result,
		T const &	old_value,
		T const &	new_value
	)

template<class InputIterator , class OutputIterator , class Predicate , class T >

OutputIterator wiselib::replace_copy_if	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	result,
		Predicate	pred,
		T const &	new_value
	)

template<class ForwardIterator , class Predicate , class T >

void wiselib::replace_if	(	ForwardIterator	first,
		ForwardIterator	last,
		Predicate	pred,
		T const &	new_value
	)

template<class BidirectionalIterator >

void wiselib::reverse	(	BidirectionalIterator	first,
		BidirectionalIterator	last
	)

template<class BidirectionalIterator , class OutputIterator >

OutputIterator wiselib::reverse_copy	(	BidirectionalIterator	first,
		BidirectionalIterator	last,
		OutputIterator	result
	)

static void wiselib::rf_call ( ) [static]

template<class ForwardIterator >

void wiselib::rotate	(	ForwardIterator	first,
		ForwardIterator	middle,
		ForwardIterator	last
	)

template<typename Arithmatic_P >

void wiselib::rotate_2D	(	Arithmatic_P	angle,
		Vec< Arithmatic_P > &	coord,
		const Vec< Arithmatic_P > &	origin = `Vec<Arithmatic_P>( 0.0, 0.0, 0.0 )`
	)		`[static]`

This method rotates a given coordinate by a given radius.

Parameters:

Arithmatic_P	angle
shawn::Vec<Arithmatic_P>&	coordinate to be rotated.
shawn::Vec<Arithmatic_P>&	coordinate to rotate around (std: (0,0,0)).

template<class ForwardIterator , class OutputIterator >

OutputIterator wiselib::rotate_copy	(	ForwardIterator	first,
		ForwardIterator	middle,
		ForwardIterator	last,
		OutputIterator	result
	)

static void wiselib::scw_notify_receivers ( struct netpacket_handler_args * args ) [static]

void wiselib::scw_radio_add_receiver ( scw_radio_delegate_t receiver )

void wiselib::scw_radio_del_receiver ( scw_radio_delegate_t receiver )

void wiselib::scw_radio_init ( void )

bool wiselib::scw_timer_add_timer	(	uint32_t	millis,
		scw_timer_delegate_t	delegate,
		void *	userdata
	)

void wiselib::scw_timer_init ( void )

template<class ForwardIterator1 , class ForwardIterator2 >

ForwardIterator1 wiselib::search	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2
	)

template<class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >

ForwardIterator1 wiselib::search	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2,
		ForwardIterator2	last2,
		BinaryPredicate	pred
	)

template<class ForwardIterator , class Size , class T , class BinaryPredicate >

ForwardIterator wiselib::search_n	(	ForwardIterator	first,
		ForwardIterator	last,
		Size	count,
		T const &	value,
		BinaryPredicate	pred
	)

template<class ForwardIterator , class Size , class T >

ForwardIterator wiselib::search_n	(	ForwardIterator	first,
		ForwardIterator	last,
		Size	count,
		T const &	value
	)

template<class RandomAccessIterator , class Compare >

void wiselib::selection_partial_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	middle,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::selection_partial_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	middle,
		RandomAccessIterator	last
	)

static unsigned int wiselib::send	(	Component *	comp,
		unsigned char *	data,
		size_t	len,
		unsigned int	port
	)		`[static]`

static unsigned int wiselib::sendTo	(	Component *	comp,
		unsigned char *	data,
		size_t	len,
		unsigned int	id,
		unsigned int	port
	)		`[static]`

template<class ForwardIterator , class T , class Compare >

pair<ForwardIterator, ForwardIterator> wiselib::sequential_equal_range	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<class ForwardIterator , class T >

pair<ForwardIterator, ForwardIterator> wiselib::sequential_equal_range	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class ForwardIterator , class T >

ForwardIterator wiselib::sequential_lower_bound	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class ForwardIterator , class T , class Compare >

ForwardIterator wiselib::sequential_lower_bound	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<class ForwardIterator , class T , class Compare >

bool wiselib::sequential_search	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<class ForwardIterator , class T >

bool wiselib::sequential_search	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class ForwardIterator , class T , class Compare >

ForwardIterator wiselib::sequential_upper_bound	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value,
		Compare	comp
	)

template<class ForwardIterator , class T >

ForwardIterator wiselib::sequential_upper_bound	(	ForwardIterator	first,
		ForwardIterator	last,
		T const &	value
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator >

OutputIterator wiselib::set_difference	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >

OutputIterator wiselib::set_difference	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result,
		Compare	comp
	)

static int wiselib::set_id	(	Component *	comp,
		int	id
	)		`[static]`

template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >

OutputIterator wiselib::set_intersection	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator >

OutputIterator wiselib::set_intersection	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >

OutputIterator wiselib::set_symmetric_difference	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result,
		Compare	comp
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator >

OutputIterator wiselib::set_symmetric_difference	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator >

OutputIterator wiselib::set_union	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result
	)

template<class InputIterator1 , class InputIterator2 , class OutputIterator , class Compare >

OutputIterator wiselib::set_union	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		InputIterator2	last2,
		OutputIterator	result,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator , class Compare >

void wiselib::sort_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

template<class RandomAccessIterator >

void wiselib::sort_heap	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator >

void wiselib::stable_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last
	)

template<class RandomAccessIterator , class Compare >

void wiselib::stable_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

static int wiselib::start ( Component * comp ) [static]

static int wiselib::stop ( Component * comp ) [static]

template<class T >

void wiselib::swap	(	T &	a,
		T &	b
	)

template<class ForwardIterator1 , class ForwardIterator2 >

ForwardIterator2 wiselib::swap_ranges	(	ForwardIterator1	first1,
		ForwardIterator1	last1,
		ForwardIterator2	first2
	)

static int wiselib::timer_elapse	(	Component *	comp,
		void *	tid,
		void *	ptr_o
	)		`[static]`

static void wiselib::timer_fired ( void * data ) [static]

template<class InputIterator1 , class InputIterator2 , class OutputIterator , class BinaryOperator >

OutputIterator wiselib::transform	(	InputIterator1	first1,
		InputIterator1	last1,
		InputIterator2	first2,
		OutputIterator	result,
		BinaryOperator	binary_op
	)

template<class InputIterator , class OutputIterator , class UnaryOperator >

OutputIterator wiselib::transform	(	InputIterator	first,
		InputIterator	last,
		OutputIterator	result,
		UnaryOperator	op
	)

template<typename OsModel_P , typename DistancePair_P , typename Arithmatic_P >

DistancePair_P wiselib::trilateration_distance	(	Arithmatic_P	s_n1,
		Arithmatic_P	s_n2,
		Arithmatic_P	n1_n2,
		Arithmatic_P	n1_anchor,
		Arithmatic_P	n2_anchor
	)

This method calculates the distance between two nodes using only distance information with trilateration.

There are two triangles known. At first, the triangle source-n1-n2, where as well the distance from source to n1 and n2 as the distance from n1 to n2 is known. Second, there is the triangle n1-n2-destination with same distance information.

Result is a choice of two valid distances.

Parameters:

Arithmatic_P	distance source-n1
Arithmatic_P	distance source-n2
Arithmatic_P	distance n1-n2
Arithmatic_P	distance n1-destination
Arithmatic_P	distance n2-destination