代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/275970/10780408
strace-graph
#!/usr/bin/perl
# This script processes strace -f output. It displays a graph of invoked
# subprocesses, and is useful for finding out what complex commands do.
# You will probably want to invoke s
www.eeworm.com/read/349903/10785748
cpp cm.cpp
/*
* cm.cpp - Finding an elliptic curve and point of nearly prime order
* See IEEE 1363 Annex A for documentation!
*
* !!! New much improved version - March 2002
* Now tested for D up to 10^
www.eeworm.com/read/275194/10829863
hpp startshape.hpp
// $startshape.hpp 1.5 milbo$ routines for finding start shape for an ASM search
#if !defined(startshape_hpp)
#define startshape_hpp
void AdjustViolaJonesShape(SHAPE &Shape); // io
bool
fGetStartS
www.eeworm.com/read/418731/10934577
txt burning bin & cue using nero.txt
Burning BIN/CUE Images with Nero Burning Rom
BIN/CUE image format is quite common on the Internet. It might seem that finding an appropriate software for burning these images is quite hard. Luckil
www.eeworm.com/read/458682/7291384
sh ex68.sh
#!/bin/bash
# sieve.sh (ex68.sh)
# Sieve of Eratosthenes
# Ancient algorithm for finding prime numbers.
# This runs a couple of orders of magnitude slower
#+ than the equivalent program written in
www.eeworm.com/read/452695/7436379
c program2_12.c
/* Program 2.12 Finding the size of a type */
#include
int main(void)
{
printf("\nVariables of type char occupy %d bytes", sizeof(char));
printf("\nVariables of type short occupy
www.eeworm.com/read/441425/7670554
m b_point.m
function pos = b_point(Eph,pr,sv,time)
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% name of ephemeris file, four
www.eeworm.com/read/441425/7670555
m k_point.m
function pos = k_point(Eph,pos,pr,sv,time)
% K_POINT Prepares input to the Kalman algorithm for finding
% the final position of a receiver. The inputs are
% preliminary station co
www.eeworm.com/read/140847/5779120
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t
www.eeworm.com/read/133943/5897306
m qmr1.m
% Make a QMR-like network
% This is a bipartite graph, where the top layer contains hidden disease nodes,
% and the bottom later contains observed finding nodes.
% The diseases have Bernoulli CPDs, t