代码搜索:模版匹配

找到约 3,092 项符合「模版匹配」的源代码

代码结果 3,092
www.eeworm.com/read/265267/4284801

php cpmenu.php

www.eeworm.com/read/268999/11111620

txt 完美c++疑难解答-模板.txt

1.多个参数的函数模版: #include "stdafx.h" templateT CCDeath(T a, T b); void main() { cout
www.eeworm.com/read/191861/8419117

cpp kuohaopipei.cpp

//刮号匹配的检验kuohaopipei.cpp #include #include #include typedef char Status; typedef char SElemType; #include "stack.cpp" void main() {SqStack *p; int n,m=32,q=0;
www.eeworm.com/read/191796/8422349

txt kuohaopipei.txt

//刮号匹配的检验kuohaopipei.cpp #include #include #include typedef char Status; typedef char SElemType; #include "stack.cpp" void main() {SqStack *p; int n,m=32,q=0;
www.eeworm.com/read/432184/8621232

h gravitytrack.h

#define EDGE_SPACE 5 //计算时留出的边界宽度 #define EDGE_DRAW 20 //画框跟踪窗时扩出的边界宽度 #define BLOCK_NUMBER 5 //分块数目 #define TEMPLETE_SIZE 60 //匹配模板大小
www.eeworm.com/read/283541/9010474

cpp findstr.cpp

//字符串的模式匹配Findstr.cpp #include #include #include #include #include #define MAXSTRLEN 64 void GetNext(char T[MAXSTRLEN],int (&next)[64]) {i
www.eeworm.com/read/281455/9154925

asv match.asv

%搜索匹配 clear; I=imread('2801.bmp'); F>0; for i=40:80 for j=40:80 X=I(i:i+39,j:j+39); x=imhist(X,8)/1600; f=alpha*y*svkernel('poly',x,sv); if f>F
www.eeworm.com/read/380114/9162265

cpp kuohaopipei.cpp

//刮号匹配的检验kuohaopipei.cpp #include #include #include typedef char Status; typedef char SElemType; #include "stack.cpp" void main() {SqStack *p; int n,m=32,q=0;
www.eeworm.com/read/380114/9162494

txt kuohaopipei.txt

//刮号匹配的检验kuohaopipei.cpp #include #include #include typedef char Status; typedef char SElemType; #include "stack.cpp" void main() {SqStack *p; int n,m=32,q=0;