代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/273657/10907946
class finding_way.class
www.eeworm.com/read/273525/4208232
hlp y_finding.hlp
{smcl}
{p 0 4}
{help contents:Top}
> {help y_basics:Basics}
{bind:> {bf:Using the Internet}}
{p_end}
{hline}
{title:Help and category listings}
{p 4 8 4}
{bf:{help y_update:Updating Stata
www.eeworm.com/read/448361/1690325
rc2 finding.rc2
//
// FINDING.RC2 - resources Microsoft Visual C++ does not edit directly
//
#ifdef APSTUDIO_INVOKED
#error this file is not editable by Microsoft Visual C++
#endif //APSTUDIO_INVOKED
///
www.eeworm.com/read/420722/2065476
rc2 finding.rc2
//
// FINDING.RC2 - resources Microsoft Visual C++ does not edit directly
//
#ifdef APSTUDIO_INVOKED
#error this file is not editable by Microsoft Visual C++
#endif //APSTUDIO_INVOKED
///
www.eeworm.com/read/473485/6844174
java finding_way.java
//Finding_way.java
//该类用来计算乘车方案。
import java.net.URL;
import java.sql.*;
public class Finding_way
{
private Beg_end_sta inputstation;//起始站点
private Path [] bestpath;//20个乘车方案
private bo
www.eeworm.com/read/473485/6844194
class finding_way.class
www.eeworm.com/read/429309/8811232
m newton_finding_roots.m
% To compute M
% Let f(x) = x^2-M;
% then f'(x) = 2*x;
% the algorithm is
% x(n+1) = x(n)-f(x(n))/f'(x(n)) = x(n)-(x(n)^2-M)/(2*x(n))
% = 0.5*(x(n)+M/x(n));
% 第 1 次计算结果：
% 1.50000000
www.eeworm.com/read/174641/9579125
c freq_max_finding.c
/*******************************************************************/
/*******************************************************************/
/* This program implements the function of finding out the