代码搜索：Infinity
找到约 1,499 项符合「Infinity」的源代码
代码结果 1,499
www.eeworm.com/read/390183/8480558
asm floatx.asm
;
; floatx.asm
;
; Test hexadecimal floating-point numbers
%define Inf __Infinity__
%define NaN __QNaN__
; 16-bit
dw 1.0
dw 0x1.0
dw 2.0
dw 0x2.0
dw 0x1.0p+1
dw 0x1.0p-1
dw 0x0
www.eeworm.com/read/367274/9763793
asm floatx.asm
;
; floatx.asm
;
; Test hexadecimal floating-point numbers
%define Inf __Infinity__
%define NaN __QNaN__
; 16-bit
dw 1.0
dw 0x1.0
dw 2.0
dw 0x2.0
dw 0x1.0p+1
dw 0x1.0p-1
dw 0x0
www.eeworm.com/read/208657/15239675
m hinfpar.m
% [a,b1,b2,c1,c2,d11,d12,d21,d22]=hinfpar(P,r)
% data = hinfpar(P,r,string)
%
% Unpacks the standard H-infinity plant
%
% | a b1 b2 |
% P = | c1 d11 d12
www.eeworm.com/read/461110/7233723
txt 头文件.txt
// c7-1.h 图的数组(邻接矩阵)存储表示
#define INFINITY INT_MAX // 用整型最大值代替∞
#define MAX_VERTEX_NUM 26 // 最大顶点个数
enum GraphKind{DG,DN,UDG,UDN}; // {有向图,有向网,无向图,无向网}
typedef struct
{
VRType adj; // 顶点
www.eeworm.com/read/235539/14064949
txt 头文件.txt
// c7-1.h 图的数组(邻接矩阵)存储表示
#define INFINITY INT_MAX // 用整型最大值代替∞
#define MAX_VERTEX_NUM 26 // 最大顶点个数
enum GraphKind{DG,DN,UDG,UDN}; // {有向图,有向网,无向图,无向网}
typedef struct
{
VRType adj; // 顶点
www.eeworm.com/read/382131/9047073
cpp bounds.cpp
#include "bounds.h"
template
T Min(T t1, T t2)
{
return (t1t2 ? t1 : t2);
}
const int INFINITY=9999999;
www.eeworm.com/read/421207/10750633
cpp bounds.cpp
#include "bounds.h"
template
T Min(T t1, T t2)
{
return (t1t2 ? t1 : t2);
}
const int INFINITY=9999999;
www.eeworm.com/read/178687/5315640
cpp bounds.cpp
#include "bounds.h"
template
T Min(T t1, T t2)
{
return (t1t2 ? t1 : t2);
}
const int INFINITY=9999999;
www.eeworm.com/read/118520/14865675
c exp3.c
#define INFINITY 10000
#define NULL 0
#define MAX_NUM 3
void ShortestPath(int C[MAX_NUM][MAX_NUM])
/*用Dijkstra算法求有向网C的v1定点到其余顶点v的带权路长D[v]
final[v]为ture当且仅当v在S的集合内，就求得从v1到v的最短路径*/
{