代码搜索:finding

找到约 1,199 项符合「finding」的源代码

代码结果 1,199
www.eeworm.com/read/246726/12707018

c massey.c

/* Author: Pate Williams (c) 1997 The following code tests an implementation of the Berlekamp-Massey algorithm for finding the linear complexity of a finite binary sequence. This is
www.eeworm.com/read/326724/13120334

m findlines.m

%Implementation of a line finding algorithm based on a Houges %transformation made by radon(). The algorithm valutates the lines based on %their clearness. A Line inside a chaotic part of the image
www.eeworm.com/read/141979/5767370

cpp elementcomparisonfunctions.cpp

/** * * @brief Namespace to encapsulate comparison and equality functions for RArray sorting and finding * * Copyright (c) EMCC Software Ltd 2003 * @version 1.0 */ // INCLUDE FILES // Clas
www.eeworm.com/read/101042/6259139

txt standards.txt

Standards related to OpenSSL ============================ [Please, this is currently a draft. I made a first try at finding documents that describe parts of what OpenSSL implements. There are big
www.eeworm.com/read/100601/6267450

h mpprime.h

/* * mpprime.h * * Utilities for finding and working with prime and pseudo-prime * integers * * The contents of this file are subject to the Mozilla Public * License Version 1.1 (the "Licens
www.eeworm.com/read/100601/6267455

c mpprime.c

/* * mpprime.c * * Utilities for finding and working with prime and pseudo-prime * integers * * The contents of this file are subject to the Mozilla Public * License Version 1.1 (the "Licens
www.eeworm.com/read/480844/6662465

txt lesson9.txt

Lesson 9: Strings This lesson is one on strings. Strings are really arrays, but there are some different functions that are used for strings, like adding to strings, finding the lengt
www.eeworm.com/read/123562/14624429

java knightboard.java

/** A variable-size chess board that supports finding a complete tour, or Hamiltonian cycle, for the knight on the board. The dimensions (width and height) of the board may be specified,
www.eeworm.com/read/476965/1365878

cpp elementcomparisonfunctions.cpp

/** * * @brief Namespace to encapsulate comparison and equality functions for RArray sorting and finding * * Copyright (c) EMCC Software Ltd 2003 * @version 1.0 */ // INCLUDE FILES // Clas
www.eeworm.com/read/284346/4066001

f1root h.f1root

* * * * * * * * f1root * * * * * * * * "finding one root" SYNTAX: X = f1root(p,P) X = f1r