代码搜索：minimum
找到约 5,594 项符合「minimum」的源代码
代码结果 5,594
www.eeworm.com/read/425394/10359093
vbp prim.vbp
Type=Exe
Form=Form1.frm
Reference=*\G{00020430-0000-0000-C000-000000000046}#2.0#0#C:\WINDOWS\system32\stdole2.tlb#OLE Automation
Startup="Form1"
ExeName32="minimum tree.exe"
Command32=""
Name="工
www.eeworm.com/read/279550/10421052
txt 赢家树 区间最值（网上的，好像有错）.txt
/*
Title : RMQ(Range Minimum Query)问题的Binary Tree解法，
查询一指定数列任意一段区间内最(大)元素的位置
Time Complex : O(n) 预处理， O(logn) 每次查询
Space Complex : O(3*n) Total space
Author : son
www.eeworm.com/read/470897/6901307
m rmtve.m
function [X1, T1X, C1X, error1]=RMTVE(X, max_fits, max_points)
% % RMTVE: Calculates the Reweighted Trimmed Minimum Vulume Ellipsoid (RMTVE) of a data set X.
% %
% % Syntax;
% %
% % [X1,T1X,C1X]
www.eeworm.com/read/407780/11410800
txt 赢家树 区间最值（网上的，好像有错）.txt
/*
Title : RMQ(Range Minimum Query)问题的Binary Tree解法，
查询一指定数列任意一段区间内最(大)元素的位置
Time Complex : O(n) 预处理， O(logn) 每次查询
Space Complex : O(3*n) Total space
Author : son
www.eeworm.com/read/38039/1091624
mnu dhdrl_angl.mnu
DHDRL#ANGLE 两面角
#
MaxDihedral 最大二面角
Calculate the maximum dihedral angle along an edge and show its location.
计算沿边的最大二面角并显示其位置。
MinDihedral 最小二面角
Calculate the minimum dihedral angle along an edge an
www.eeworm.com/read/240204/4577420
h template.h
/* T e m p l a t e F o r S y m b o l T a b l e M a n a g e r */
/* define some hash function */
#ifndef HASH
#define HASH(p, h) while ( *p != '\0' ) h = (h
www.eeworm.com/read/207991/5000320
mal rangepush00.mal
# propagate the minimum lowerbound
b := bat.new(:void,:int);
s1:= algebra.select(b,1,80);
s2:= algebra.select(s1,nil:int,75);
io.print(s2);
optimizer.pushranges();
optimizer.deadcode();
mdb.list();
www.eeworm.com/read/372616/2770517
h si21xx.h
#ifndef SI21XX_H
#define SI21XX_H
#include
#include "dvb_frontend.h"
struct si21xx_config {
/* the demodulator's i2c address */
u8 demod_address;
/* minimum delay before r
www.eeworm.com/read/473191/6857837
txt 赢家树 区间最值（网上的，好像有错）.txt
/*
Title : RMQ(Range Minimum Query)问题的Binary Tree解法，
查询一指定数列任意一段区间内最(大)元素的位置
Time Complex : O(n) 预处理， O(logn) 每次查询
Space Complex : O(3*n) Total space
Author : son
www.eeworm.com/read/100135/15883067
h template.h
/* T e m p l a t e F o r S y m b o l T a b l e M a n a g e r */
/* define some hash function */
#ifndef HASH
#define HASH(p, h) while ( *p != '\0' ) h = (h