代码搜索:Mod1

找到约 149 项符合「Mod1」的源代码

代码结果 149
www.eeworm.com/read/237787/13929667

vbw 采购管理系统.vbw

frm_main = 66, 66, 401, 387, C, 88, 88, 422, 409, C frm_gysgl = 44, 44, 380, 365, C, 22, 22, 358, 343, C Mod1 = 0, 0, 432, 321, C frm_cgclgl = 70, 78, 406, 399, C, 74, 44, 410, 365, C frm_cgygl =
www.eeworm.com/read/237783/13929953

bas mod1.bas

Attribute VB_Name = "Mod1" Public adoCon As New ADODB.Connection '定义一个数据连接 Public adoRs As New ADODB.Recordset '定义一个数据集对象 Public adoRs1 As New ADODB.Recordset '定义一个数据集对象 Publi
www.eeworm.com/read/305303/3774703

xql usemod.xql

import module namespace M1 = "http://xquery.gnu/testsuite/Mod1"; import module namespace M2 = "gnu.xquery.testsuite.Mod2"; declare variable $one := 1; ($M1:vv+$one),M2:twice(M1:twice($M2:vv)+$M2:twel
www.eeworm.com/read/390421/8465933

sp wire.sp

wire model .opt list acct limpts=1000 .global vd Vdd vd 0 5 .subckt inverter1 in out Mp out in vd vd MOD2 W=96u L=0.8u Mn out in 0 0 MOD1 W=32u L=0.8u .ends inverter1 .subckt inver
www.eeworm.com/read/390421/8465962

sp wiredelay.sp

wire delay model .opt list acct limpts=1000 .global vd Vdd vd 0 5 .subckt inverter1 in out Mp out in vd vd MOD2 W=96u L=0.8u Mn out in 0 0 MOD1 W=32u L=0.8u .ends inverter1 .subckt
www.eeworm.com/read/453400/7421778

sas func2.sas

option nodate nonumber; title 'Arithmetic functions'; data func2; input x1-x4@@; abs1=abs(x1);max1=max(of x1-x4);min1=min(of x1-x4); mod1=mod(x2,x4);sign1=sign(x4);sqrt1=sqrt(x4); cards;
www.eeworm.com/read/37815/905690

txt fake.txt

name mod1 mod2 mod3 mod4 mod5 mod6 mod7 mod8 mod9 mod10 res-all res-fire res-ltng res-cold res-pois res-all-max res-fire-max res-ltng-max res-cold-max res-pois-max all-stats str enr dex
www.eeworm.com/read/38416/1112684

txt fake.txt

name mod1 mod2 mod3 mod4 mod5 mod6 mod7 mod8 mod9 mod10 res-all res-fire res-ltng res-cold res-pois res-all-max res-fire-max res-ltng-max res-cold-max res-pois-max all-stats str enr dex
www.eeworm.com/read/415872/11049688

txt 001[1].sap笔试题1.txt

1 两个人轮流拿10个硬币,每次可拿1,2,4个,拿到最后一个的为输,问有无必胜条 件? 答:后拿者赢 2 有1000个表,每个表有若干个item,每个item形式为(x,y),寻找这些表中overlapp ed的item 3 用一串节点存放N个数据,每个节点可放k个数据,其中包含额外的b个数据,问k为多 少最能节省存储空间(假设N/(k-b)<mark>mod1</mark>=1/2) 4 一 ...