-
each RFC 3261 header is a corresponding access logo. However, many information f...
每个RFC 3261信息头有一个相应的存取标识. 但是,许多信息头拥有同样的形式。 例如。To和From的信息头都是由显示名和一个URI组成。 To和From信息头用来管理与处理NameAddr实例的. 这个类管理每个信息头类型来负责 解析信息头文本,倘若存储和存取在信息的生存期间,和序列化信息头值为翻译的文本。 下面的表显示了reSIP当前支持的每个RFC信息头的reSIP类型。 reSIP类型是一个SIP信息的信息头调用存取标识作为它的参数的返回类型。-each RFC 3261 header is a corresponding access logo. However, many information first with the same form. For example. To and From the information revealed by the first name and a URI component. To and From the first information for the management and disposal of NameAddr examples. The management of each category of information for the first type of analytical information to the first version, if the storage and access of information in the survival period, and sequence information for the first value of the text translation. The following table shows the current reSIP support of each of the first RFC information reSIP types. ReSIP type of information is a SIP call the first access to information as its logo to the return parameter types.
- 2022-01-24 14:57:37下载
- 积分:1
-
数据结构学习中常用的程序.用c语言编写.vc++6.0运行通过...
数据结构学习中常用的程序.用c语言编写.vc++6.0运行通过-data structure commonly used to study the procedures. C language used. Vc++6.0 running through
- 2022-01-25 17:31:30下载
- 积分:1
-
Prime number algorithm of the program to quickly calculate the first n a prime n...
素数算法的程序,能快速计算出前n个素数
- 2022-01-26 05:43:43下载
- 积分:1
-
Combine two polynomials using linked list, then format printing
利用链表解决合并两个多项式的问题,最后按格式输出多项式-Combine two polynomials using linked list, then format printing
- 2022-02-06 04:34:01下载
- 积分:1
-
利用分裂基算法求实序列 的DFT, 的虚部赋值为零。
利用分裂基算法求实序列 的DFT, 的虚部赋值为零。-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment to zero.
- 2022-11-17 08:45:04下载
- 积分:1
-
一个效率还可以的配对堆
Fibonacci Heap太难写了
配对堆可以有效替代Fibonacci Heap
附带了用它实现的Dijkstra...
一个效率还可以的配对堆
Fibonacci Heap太难写了
配对堆可以有效替代Fibonacci Heap
附带了用它实现的Dijkstra
复杂度O(nlogn+e)
-An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)
- 2022-06-13 04:20:15下载
- 积分:1
-
JAVA源代码反编译超级引挚
JAVA源代码反编译超级引挚 -Java source code compiler- super engine
- 2023-06-21 01:00:04下载
- 积分:1
-
在顺序存储结构上,采用顺序查找算法,直接插入排序算法等算法查找一关键字,输出查找结果...
在顺序存储结构上,采用顺序查找算法,直接插入排序算法等算法查找一关键字,输出查找结果-In the sequential storage structure, using the sequential search algorithm, sorting algorithm directly into the search for a keyword such as algorithms, the output search results
- 2022-02-04 13:48:57下载
- 积分:1
-
Oracle 10g精要 第三版
Oracle 10g精要 第三版-essence of the third edition of Oracle 10g
- 2022-03-23 06:53:53下载
- 积分:1
-
C++ Builder程序员学习数据结构第4章
C++ Builder程序员学习数据结构第4章-Builder C programmers to learn data structure Chapter 4
- 2022-08-05 11:23:20下载
- 积分:1