代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/415537/11066197
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/147693/12538488
pl fig9_21.pl
% Figure 9.21 Path-finding in a graph: Path is
% an acyclic path with cost Cost from A to Z in Graph.
% path( A, Z, Graph, Path, Cost):
% Path is an acyclic path with cost Cost from A to
www.eeworm.com/read/235187/14082435
m decorrel.m
function [Q,Z,L,D,z] = decorrel (Q,a);
%DECORREL: Decorrelate a (co)variance matrix of ambiguities
%
% This routine creates a decorrelated Q-matrix, by finding the
% Z-matrix and performing the co
www.eeworm.com/read/202486/15381624
cpp pr0519.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 5.19 on page 113
// Finding the least common multiple
#include // defines th
www.eeworm.com/read/202486/15381661
cpp pr0611.cpp
// Programming with C++, Second Edition, by John R. Hubbard
// Copyright McGraw-Hill, 2000
// Problem 6.11 on page 143
// Finding the two largest values in an array
#include // d
www.eeworm.com/read/111805/15503099
java nameandaddresssaver.java
// Chapter 11 Exercise 6
/*
This is a modification of the Ch11 ex 5 solution to make
use of an index file for finding name & address records.
This uses a different name and address file t
www.eeworm.com/read/103200/15740799
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/100612/15868954
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/385447/8804681
txt description.txt
The complex (or real) Grassmann manifold G(m,k) is the set of k-dimensional subspaces in Cm (or Rm). Grassmannian subspace packing is the problem of finding a set of N k-dimensional subspaces in G(m,
www.eeworm.com/read/282090/9120283
c map.c
// map.c
#include "qbsp.h"
int entitySourceBrushes; // to track editor brush numbers
int numMapPatches;
// undefine to make plane finding use linear sort
#define USE_HASHING
#defi