代码搜索:adding

找到约 4,236 项符合「adding」的源代码

代码结果 4,236
www.eeworm.com/read/128502/5989983

preinst

#!/bin/sh -e if getent group gnokii; then echo "Found group 'gnokii', not adding..." else /usr/sbin/groupadd gnokii fi #DEBHELPER#
www.eeworm.com/read/112822/6143329

out ncprep.out

ncprep: v03.30.(p001): (c) Copyright 1995 - 2001 Cadence Design Systems, Inc. Adding -UPDATE option, to disable update run ncprep with the +noupdate Translation successful.
www.eeworm.com/read/105275/6200022

html,v sharingformusers.html,v

head 1.2; access; symbols; locks; strict; comment @# @; 1.2 date 2001.03.25.23.30.49; author wombat; state Exp; branches; next 1.1; 1.1 date 2001.02.24.17.01.40; author wombat; state Exp; branches;
www.eeworm.com/read/493718/6389238

pas ac1047.pas

{Because a[i]=(a[i-1]+a[i+1])/2-c[i], therefore 2*a[i]+2*c[i]=a[i-1]+a[i+1]. Let i be every integer between 1 and n inclusive, we have n formulae. Adding all them together, we obtain a[1]+
www.eeworm.com/read/482546/6617528

lis p18f97j60dk.lis

AutoECO Report FILE-A: D:\TONGHOP\ANHVU\ANHVU1\ORCAD\PICXXX\18F97J60\P18F97J60DK.MAX FILE-B: D:\TONGHOP\ANHVU\ANHVU1\ORCAD\PICXXX\18F97J60\P18F97J60DK.MNL If "*EOF*" immediately follows, no changes
www.eeworm.com/read/482546/6617555

lis h18f97j60.lis

AutoECO Report FILE-A: D:\TONGHOP\ANHVU\ANHVU1\ORCAD\PICXXX\18F97J60HEADER\H18F97J60.MAX FILE-B: D:\TONGHOP\ANHVU\ANHVU1\ORCAD\PICXXX\18F97J60HEADER\H18F97J60.MNL If "*EOF*" immediately follows, no
www.eeworm.com/read/410432/11287431

c put1.c

/* put1.c 枛 prints a string without adding \n */ #include void put1(const char * string) /* string not altered */ { while (*string != '\0') putchar(*string++); }
www.eeworm.com/read/400573/11573626

java addtool.java

//addTool.java,接口程序 //Author X.H.Sun, 2001.03.16 public interface addTool{ IllegalArgumentException err1 = new IllegalArgumentException( "incompatible objects in sort"); //ad
www.eeworm.com/read/154775/11927104

ideas

On Speeding up RAID5 Reconfiguration Pass 1: if we're adding disks for each new disk for each block if it's not a parity block convert it to a global block # & wish for it Pass 2: for each
www.eeworm.com/read/231652/14224855

pas ac1047.pas

{Because a[i]=(a[i-1]+a[i+1])/2-c[i], therefore 2*a[i]+2*c[i]=a[i-1]+a[i+1]. Let i be every integer between 1 and n inclusive, we have n formulae. Adding all them together, we obtain a[1]+