代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/149098/5703485
cpp find_end.cpp
/**************************************************************************
*
* find_end.cpp - Example program for finding a subsequence.
* See Class Reference Section
*
****
www.eeworm.com/read/100285/6271275
c hashutils.c
/*-------------------------------------------------------------------------
*
* hashutils.c
* Utilities for finding applicable merge clauses and pathkeys
*
* Copyright (c) 1994, Regents of the
www.eeworm.com/read/100285/6271279
c mergeutils.c
/*-------------------------------------------------------------------------
*
* mergeutils.c
* Utilities for finding applicable merge clauses and pathkeys
*
* Copyright (c) 1994, Regents of the
www.eeworm.com/read/12865/249865
cpp find_end.cpp
/**************************************************************************
*
* find_end.cpp - Example program for finding a subsequence.
* See Class Reference Section
*
****
www.eeworm.com/read/424704/2014346
cpp find_end.cpp
/**************************************************************************
*
* find_end.cpp - Example program for finding a subsequence.
* See Class Reference Section
*
****
www.eeworm.com/read/100803/15864168
c ntscclsh.c
///////////////////////////////////////////////////////////////////////
// File Name: NTSCCLSTH.C
//
// This file contains functions, for allocating, finding allocated
// component instances, and
www.eeworm.com/read/430037/1942693
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al
www.eeworm.com/read/430037/1942722
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al
www.eeworm.com/read/430037/1942767
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al
www.eeworm.com/read/430037/1942801
m prel.m
%finding the minimal primitive element of a prime field GF(p),
function[alp]=prel(p);
z=factor(p-1); ord=(p-1)./z; l=length(z); %all element orders;
alp=1; u=1; %start finding primitive element "al