⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 tags

📁 CBRP协议(移动adhoc中基于分簇的路由协议)ns2下的源码
💻
字号:
!_TAG_FILE_FORMAT	2	/extended format; --format=1 will not append ;" to lines/!_TAG_FILE_SORTED	1	/0=unsorted, 1=sorted/!_TAG_PROGRAM_AUTHOR	Darren Hiebert	/darren@hiebert.com/!_TAG_PROGRAM_NAME	Exuberant Ctags	//!_TAG_PROGRAM_URL	http://darren.hiebert.com/ctags/	/official site/!_TAG_PROGRAM_VERSION	3.2	/with C, C++, Eiffel, Fortran, and Java  support/ComputeW	calcdest.cc	/^ComputeW()$/;"	fComputeW	setdest.cc	/^ComputeW()$/;"	fD1	calcdest.cc	/^u_int32_t	*D1 = 0;$/;"	vD1	setdest.cc	/^u_int32_t	*D1 = 0;$/;"	vD2	calcdest.cc	/^u_int32_t	*D2 = 0;$/;"	vD2	setdest.cc	/^u_int32_t	*D2 = 0;$/;"	vDestUnreachableCount	calcdest.cc	/^u_int32_t	DestUnreachableCount = 0;$/;"	vDestUnreachableCount	setdest.cc	/^u_int32_t	DestUnreachableCount = 0;$/;"	vDump	calcdest.cc	/^Node::Dump()$/;"	f	class:NodeDump	setdest.cc	/^Node::Dump()$/;"	f	class:NodeGOD_FORMAT	calcdest.cc	22;"	d	file:GOD_FORMAT	setdest.cc	22;"	d	file:GOD_FORMAT2	calcdest.cc	23;"	d	file:GOD_FORMAT2	setdest.cc	23;"	d	file:INFINITY	calcdest.cc	28;"	d	file:INFINITY	setdest.cc	28;"	d	file:INVERSE_M	calcdest.cc	79;"	d	file:INVERSE_M	setdest.cc	76;"	d	file:LIST_FIRST	setdest.h	7;"	dLIST_NEXT	setdest.h	10;"	dLinkChangeCount	calcdest.cc	/^u_int32_t       LinkChangeCount = 0;$/;"	vLinkChangeCount	setdest.cc	/^u_int32_t       LinkChangeCount = 0;$/;"	vM	calcdest.cc	78;"	d	file:M	setdest.cc	75;"	d	file:MAXSPEED	calcdest.cc	/^double		MAXSPEED = 0.0;$/;"	vMAXSPEED	setdest.cc	/^double		MAXSPEED = 0.0;$/;"	vMAXTIME	calcdest.cc	/^double		MAXTIME = 0.0;		\/\/ duration of simulation$/;"	vMAXTIME	setdest.cc	/^double		MAXTIME = 0.0;		\/\/ duration of simulation$/;"	vMAXX	calcdest.cc	/^double		MAXX = 0.0;$/;"	vMAXX	setdest.cc	/^double		MAXX = 0.0;$/;"	vMAXY	calcdest.cc	/^double		MAXY = 0.0;$/;"	vMAXY	setdest.cc	/^double		MAXY = 0.0;$/;"	vNODES	calcdest.cc	/^u_int32_t	NODES = 0;$/;"	vNODES	setdest.cc	/^u_int32_t	NODES = 0;$/;"	vNODE_FORMAT	calcdest.cc	24;"	d	file:NODE_FORMAT	setdest.cc	24;"	d	file:NODE_FORMAT2	calcdest.cc	25;"	d	file:NODE_FORMAT2	setdest.cc	25;"	d	file:NODE_FORMAT3	calcdest.cc	26;"	d	file:NODE_FORMAT3	setdest.cc	26;"	d	file:Neighbor	setdest.h	/^class Neighbor {$/;"	cNode	calcdest.cc	/^Node::Node()$/;"	f	class:NodeNode	setdest.cc	/^Node::Node()$/;"	f	class:NodeNode	setdest.h	/^class Node {$/;"	cNodeIndex	calcdest.cc	/^u_int32_t Node::NodeIndex = 0;$/;"	m	class:NodeNodeIndex	setdest.cc	/^u_int32_t Node::NodeIndex = 0;$/;"	m	class:NodeNodeIndex	setdest.h	/^	static u_int32_t	NodeIndex;$/;"	m	class:NodeNodeList	calcdest.cc	/^Node		*NodeList = 0;$/;"	vNodeList	setdest.cc	/^Node		*NodeList = 0;$/;"	vOpenAndReadHeader	calcdest.cc	/^OpenAndReadHeader(char *in_filename, char *out_filename)$/;"	fPAUSE	calcdest.cc	/^double		PAUSE = 0.0;$/;"	vPAUSE	setdest.cc	/^double		PAUSE = 0.0;$/;"	vRANGE	calcdest.cc	/^double	        RANGE = 250.0;		\/\/ transmitter range in meters$/;"	vRANGE	setdest.cc	/^const double	RANGE = 250.0;		\/\/ transmitter range in meters$/;"	vROUND_ERROR	calcdest.cc	31;"	d	file:ROUND_ERROR	setdest.cc	31;"	d	file:RandomDestination	calcdest.cc	/^Node::RandomDestination()$/;"	f	class:NodeRandomDestination	setdest.cc	/^Node::RandomDestination()$/;"	f	class:NodeRandomPosition	calcdest.cc	/^Node::RandomPosition()$/;"	f	class:NodeRandomPosition	setdest.cc	/^Node::RandomPosition()$/;"	f	class:NodeRandomSpeed	calcdest.cc	/^Node::RandomSpeed()$/;"	f	class:NodeRandomSpeed	setdest.cc	/^Node::RandomSpeed()$/;"	f	class:NodeReadInMovementPattern	calcdest.cc	/^ReadInMovementPattern()$/;"	fRouteChangeCount	calcdest.cc	/^u_int32_t	RouteChangeCount = 0;$/;"	vRouteChangeCount	setdest.cc	/^u_int32_t	RouteChangeCount = 0;$/;"	vSANITY_CHECKS	calcdest.cc	18;"	d	file:SANITY_CHECKS	setdest.cc	18;"	d	file:TIME	calcdest.cc	/^double		TIME = 0.0;		\/\/ my clock;$/;"	vTIME	setdest.cc	/^double		TIME = 0.0;		\/\/ my clock;$/;"	vUpdate	calcdest.cc	/^Node::Update()$/;"	f	class:NodeUpdate	setdest.cc	/^Node::Update()$/;"	f	class:NodeUpdateNeighbors	calcdest.cc	/^Node::UpdateNeighbors()$/;"	f	class:NodeUpdateNeighbors	setdest.cc	/^Node::UpdateNeighbors()$/;"	f	class:NodeX	setdest.h	/^	double X;$/;"	m	class:vectorX	setdest.h	/^  double X, Y, Z;$/;"	m	struct:setdestY	setdest.h	/^	double Y;$/;"	m	class:vectorY	setdest.h	/^  double X, Y, Z;$/;"	m	struct:setdestZ	setdest.h	/^	double Z;$/;"	m	class:vectorZ	setdest.h	/^  double X, Y, Z;$/;"	m	struct:setdest__setdest_h__	setdest.h	2;"	dcount	calcdest.cc	/^static int count = 0;$/;"	v	file:count	setdest.cc	/^static int count = 0;$/;"	v	file:destination	setdest.h	/^	vector		destination;		\/\/ destination$/;"	m	class:Nodedirection	setdest.h	/^	vector		direction;		\/\/ computed from pos and dest$/;"	m	class:Nodedumpall	calcdest.cc	/^void dumpall()$/;"	fdumpall	setdest.cc	/^void dumpall()$/;"	ffloyd_warshall	calcdest.cc	/^floyd_warshall()$/;"	ffloyd_warshall	setdest.cc	/^floyd_warshall()$/;"	fin_file	calcdest.cc	/^FILE            *in_file;$/;"	vindex	setdest.h	/^	u_int32_t	index;			\/\/ index into NodeList$/;"	m	class:Neighborindex	setdest.h	/^	u_int32_t	index;                  \/\/ unique node identifier$/;"	m	class:Nodeinit	calcdest.cc	/^init()$/;"	finit	setdest.cc	/^init()$/;"	flength	setdest.h	/^	double length() {$/;"	f	class:vectorlink_changes	setdest.h	/^        int             link_changes;$/;"	m	class:Nodemain	calcdest.cc	/^main(int argc, char **argv)$/;"	fmain	setdest.cc	/^main(int argc, char **argv)$/;"	fmax	calcdest.cc	30;"	d	file:max	setdest.cc	30;"	d	file:min	calcdest.cc	29;"	d	file:min	setdest.cc	29;"	d	file:neighbor	setdest.h	/^	Neighbor	*neighbor;$/;"	m	class:Nodeoperator !=	setdest.h	/^	inline int vector::operator!=(const vector a) {$/;"	f	class:vectoroperator *	setdest.h	/^	friend inline vector operator*(const double a, const vector b) {$/;"	f	class:vectoroperator +=	setdest.h	/^	inline void vector::operator+=(const vector a) {$/;"	f	class:vectoroperator -	setdest.h	/^	inline vector operator-(const vector a) {$/;"	f	class:vectoroperator /	setdest.h	/^	friend inline vector operator\/(const vector a, const double b) {$/;"	f	class:vectoroperator =	setdest.h	/^	inline void vector::operator=(const vector a) {$/;"	f	class:vectoroperator ==	setdest.h	/^	inline int vector::operator==(const vector a) {$/;"	f	class:vectorout_file	calcdest.cc	/^FILE            *out_file;$/;"	vposition	setdest.h	/^	vector		position;		\/\/ current position$/;"	m	class:Noderandom_state	calcdest.cc	/^char random_state[32];$/;"	vrandom_state	setdest.cc	/^char random_state[32];$/;"	vreachable	setdest.h	/^	u_int32_t	reachable;		\/\/ != 0 --> reachable.$/;"	m	class:Neighborroute_changes	setdest.h	/^	int		route_changes;$/;"	m	class:Nodesetdest	setdest.h	/^struct setdest {$/;"	sshow_counters	calcdest.cc	/^show_counters()$/;"	fshow_counters	setdest.cc	/^show_counters()$/;"	fshow_diffs	calcdest.cc	/^show_diffs()$/;"	fshow_diffs	setdest.cc	/^show_diffs()$/;"	fshow_routes	calcdest.cc	/^show_routes()$/;"	fshow_routes	setdest.cc	/^show_routes()$/;"	fspeed	setdest.h	/^	double		speed;$/;"	m	class:Nodespeed	setdest.h	/^  double speed;$/;"	m	struct:setdesttime	setdest.h	/^  double time;$/;"	m	struct:setdesttime_arrival	setdest.h	/^	double		time_arrival;		\/\/ time of arrival at dest$/;"	m	class:Nodetime_transition	setdest.h	/^	double		time_transition;	\/\/ min of all neighbor times$/;"	m	class:Nodetime_transition	setdest.h	/^	double		time_transition;	\/\/ next change$/;"	m	class:Neighbortime_update	setdest.h	/^	double		time_update;		\/\/ when pos last updated$/;"	m	class:Nodeuniform	calcdest.cc	/^uniform()$/;"	funiform	setdest.cc	/^uniform()$/;"	fusage	calcdest.cc	/^usage(char **argv)$/;"	fusage	setdest.cc	/^usage(char **argv)$/;"	fvector	setdest.h	/^	vector(double x = 0.0, double y = 0.0, double z = 0.0) {$/;"	f	class:vectorvector	setdest.h	/^class vector {$/;"	c

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -