代码搜索:minimum

找到约 5,594 项符合「minimum」的源代码

代码结果 5,594
www.eeworm.com/read/368130/2825079

h layoutdlg.h

#ifndef _LAYOUTDLG_H_ #define _LAYOUTDLG_H_ #include "ui_layoutdlg.h" class CLayoutDlg : public QDialog, public Ui_LayoutDlg { Q_OBJECT public: CLayoutDlg(QWidget* = 0); virtual QSize minimum
www.eeworm.com/read/367182/2850280

h local_lim.h

/* Minimum guaranteed maximum values for system limits. Linux/PPC version. Copyright (C) 1993-1998,2000,2002-2004,2006 Free Software Foundation, Inc. This file is part of the GNU C Library.
www.eeworm.com/read/367182/2850304

h local_lim.h

/* Minimum guaranteed maximum values for system limits. Linux/Alpha version. Copyright (C) 1993-1998,2000,2002,2003,2004 Free Software Foundation, Inc. This file is part of the GNU C Library.
www.eeworm.com/read/367182/2850439

h local_lim.h

/* Minimum guaranteed maximum values for system limits. Linux/SPARC version. Copyright (C) 1993-1998,2000,2002,2003,2004 Free Software Foundation, Inc. This file is part of the GNU C Library.
www.eeworm.com/read/367182/2851235

s s_fmin.s

/* Floating-point minimum. PowerPC version. Copyright (C) 1997, 1999 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redis
www.eeworm.com/read/357083/3030729

h shmparam.h

#ifndef _ASM_IA64_SHMPARAM_H #define _ASM_IA64_SHMPARAM_H /* * SHMLBA controls minimum alignment at which shared memory segments * get attached. The IA-64 architecture says that there may be a *
www.eeworm.com/read/357022/3035026

data dns_db_find_9.data

$TTL 1000 @ in soa localhost. postmaster.localhost. ( 1993050801 ;serial 3600 ;refresh 1800 ;retry 604800 ;expiration 3600 ) ;minimum a.b.c.d in NS ns1.vix.com. a.b.c in A
www.eeworm.com/read/357022/3035054

data dns_db_find_5.data

$TTL 1000 @ in soa localhost. postmaster.localhost. ( 1993050801 ;serial 3600 ;refresh 1800 ;retry 604800 ;expiration 3600 ) ;minimum a.b.c in DNAME x.y.z a.x.y.z in A 1.2.3
www.eeworm.com/read/356084/3042450

m findpathinnng.m

% FindPathInNNG -- Find the minimum distance path in the near neighbour graph % Usage % [Path,dist] = FindPathInNNG(v0,v1,n); % Inputs % v0,v1 start and end vertices % n ext
www.eeworm.com/read/353571/3084881

h layoutdlg.h

#ifndef _LAYOUTDLG_H_ #define _LAYOUTDLG_H_ #include "ui_layoutdlg.h" class CLayoutDlg : public QDialog, public Ui_LayoutDlg { Q_OBJECT public: CLayoutDlg(QWidget* = 0); virtual QSize minimum