代码搜索:minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/111695/6153478
java datasetutilities.java
/* ======================================
* JFreeChart : a free Java chart library
* ======================================
*
* Project Info: http://www.jfree.org/jfreechart/index.html
* Pr
www.eeworm.com/read/106597/6191817
c tbdm.c
/*
$Log: tbdm.c,v $
Revision 1.1.1.1 2002/07/28 05:23:47 freeman_yong
lpc10 codec
* Revision 1.1 1996/08/19 22:30:26 jaf
* Initial revision
*
*/
#ifdef P_R_O_T_O_T_Y_P_E_S
ext
www.eeworm.com/read/105889/6197336
java gridrange.java
/*$************************************************************************************************
**
** $Id: GridRange.java,v 1.3 2004/04/28 19:40:26 desruisseaux Exp $
**
** $Source: /cvsroot/g
www.eeworm.com/read/101082/6245122
1 mmapalignment.1
.TH mmapalignment 1
.SH Name
mmapalignment \- returns minimum address alignment
.SH Syntax
\fBmmapalignment\fP
.SH Description
.NXR "address alignment"
.NXR "memory mapping" "address alignment"
The
.P
www.eeworm.com/read/101082/6247015
1 mmapalignment.1
.TH mmapalignment 1
.SH Name
mmapalignment \- returns minimum address alignment
.SH Syntax
\fBmmapalignment\fP
.SH Description
.NXR "address alignment"
.NXR "memory mapping" "address alignment"
The
.P
www.eeworm.com/read/255407/6291104
cpp template.cpp
// Section 10.1
// $ CC template.cpp
/*
minimum of 10 and 20 is: 10
minimum of 10.3 and 20.6 is: 10.3
*/
#include
using std::cout;
using std::endl;
template
www.eeworm.com/read/472938/6306881
m hpso.m
function [x,fval,gfx,output]=hPSO(fitnessfun,nvars,options,varargin)
%Syntax: [x,fval,gfx,output]=hPSO(fitnessfun,nvars,options,varargin)
%___________________________________________________________
www.eeworm.com/read/418906/6339430
cpp c9-14.cpp
#include
using namespace std;
template
class Compare
{public:
Compare(numtype a,numtype b)
{x=a;y=b;}
numtype max()
{return (x>y)?x:y;}
numtype min
www.eeworm.com/read/492901/6412600
cpp d11r6.cpp
#include "iostream.h"
#include "math.h"
double func2(double x[], int n)
{
return 0.5 - bessj0(pow((x[1] - 1.0) , 2) +
pow((x[2] - 2.0), 2) + pow((x[3] - 3.0) , 2));
}
double func(d
www.eeworm.com/read/488750/6485101
c selection sort.c
#include
#include
int minimum(int *a ,int i ,int j)
{
int k,min = i;
for(k=i+1;k a[k])
min = k;
return min;
}
void