代码搜索：zero
找到约 10,000 项符合「zero」的源代码
代码结果 10,000
www.eeworm.com/read/258581/11853223
h bldczc.h
/*******************************************************************************
* Freescale Inc.
* (c) Copyright 2005 Freescale, Inc.
* ALL RIGHTS RESERVED.
**************************************
www.eeworm.com/read/258562/11854004
f90 secant.f90
module NUMERICAL
implicit none
real, parameter :: zero=0.00001 ! 小于zero的值会被当成0
contains
! 割线法的函数
real function secant(a,b,f)
implicit none
real :: a,b ! 起始的两个猜值
real :: c ! 新的解
www.eeworm.com/read/155415/11876389
cpp listboxst.cpp
#include "stdafx.h"
#include "ListBoxST.h"
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
#define MASK_DWDATA 0x01 // dwItemData is valid
www.eeworm.com/read/257078/11951378
m fsolvtion2.m
function B=fsolvtion2(A)
% A为系数矩阵
[m n]=size(A);
if m==n&det(A)~=0
disp('only zero solvtion')
end
format rat %指定有理式格式输出
B=null(A,'r'); %求解空间的有理基
www.eeworm.com/read/257078/11951424
m fsolvtion.m
function B=fsolvtion(A)
% A为系数矩阵
[m n]=size(A);
if m==n&det(A)~=0
disp('only zero solvtion')
end
rref(A)
www.eeworm.com/read/256636/11982475
cpp bfs.cpp
#include "stdafx.h"
#include "bfs.h"
extern HASH tree;
CString BFS::getIntroduction(){
CString intro = "广度优先搜索\r\n\r\n"
"能保证找到最优解，搜索方式为逐层搜索。";
return intro;
}
int BFS::searc
www.eeworm.com/read/256636/11982541
cpp astar1.cpp
#include "stdafx.h"
#include "astar1.h"
struct cmp{
inline bool operator()(const int & a, const int & b) const{
if(open[a].val == open[b].val)
return open[a].step > open[b].step;
www.eeworm.com/read/256636/11982580
cpp astar2.cpp
#include "stdafx.h"
#include "astar2.h"
struct cmp{
bool operator()(const int & a, const int & b) const{
if(open[a].val == open[b].val)
return open[a].step > open[b].step;
return
www.eeworm.com/read/256636/11982594
cpp ida.cpp
#include "stdafx.h"
#include "ida.h"
extern HASH tree;
CString IDA::getResult(){
CString str = searcher::getResult();
if(result == SUCCESS){
char ss[50];
sprintf(ss, "\r\n迭代时最多扩展出%d
www.eeworm.com/read/256636/11982637
cpp dfs.cpp
#include "stdafx.h"
#include "dfs.h"
CString DFS::getIntroduction(){
CString intro = "深度优先搜索\r\n\r\n"
"搜索时优先搜索子树，"
"但是不能保证找到最优解。";
return intro;
}
int DFS::search(int b