代码搜索:LONG

找到约 10,000 项符合「LONG」的源代码

代码结果 10,000
www.eeworm.com/read/182288/9208443

bas lockclose.bas

Attribute VB_Name = "Module1" Private Declare Function GetSystemMenu Lib "User32" (ByVal hwnd As Long, ByVal bRevert As Long) As Long Private Declare Function RemoveMenu Lib "User32" (ByVal hMenu As
www.eeworm.com/read/182288/9208446

frm 用户登录.frm

VERSION 5.00 Begin VB.Form 用户登录 BorderStyle = 1 'Fixed Single Caption = "用户登录" ClientHeight = 2535 ClientLeft = 2745 ClientTop = 2835 Cli
www.eeworm.com/read/182288/9208448

frm 硬座票价调整.frm

VERSION 5.00 Object = "{00028C01-0000-0000-0000-000000000046}#1.0#0"; "DBGRID32.OCX" Begin VB.Form 硬座票价调整 BorderStyle = 1 'Fixed Single Caption = "票价调整" ClientHeight
www.eeworm.com/read/182288/9208449

frm 启动.frm

VERSION 5.00 Begin VB.Form 启动 BorderStyle = 3 'Fixed Dialog Caption = "启动" ClientHeight = 8670 ClientLeft = 45 ClientTop = 330 ClientWidt
www.eeworm.com/read/182288/9208451

frm 硬卧票价调整.frm

VERSION 5.00 Object = "{00028C01-0000-0000-0000-000000000046}#1.0#0"; "DBGRID32.OCX" Begin VB.Form 硬卧票价调整 BorderStyle = 1 'Fixed Single Caption = "票价调整" ClientHeight
www.eeworm.com/read/182288/9208472

frm 涨幅调整.frm

VERSION 5.00 Begin VB.Form 涨幅调整 BorderStyle = 1 'Fixed Single Caption = "涨幅调整" ClientHeight = 2280 ClientLeft = 2820 ClientTop = 2910 Cli
www.eeworm.com/read/182288/9208490

frm 软卧票价调整.frm

VERSION 5.00 Object = "{00028C01-0000-0000-0000-000000000046}#1.0#0"; "DBGRID32.OCX" Begin VB.Form 软卧票价调整 BorderStyle = 1 'Fixed Single Caption = "票价调整" ClientHeight
www.eeworm.com/read/182288/9208494

frm 密码操作.frm

VERSION 5.00 Begin VB.Form 密码 BorderStyle = 1 'Fixed Single Caption = "密码修改" ClientHeight = 2535 ClientLeft = 5055 ClientTop = 3975 Clien
www.eeworm.com/read/182284/9209270

m sl.m

function [s1l,s2l]=sl(a,N,Tb,L,Eb,Be,Bo,b2,detaPHI,Long,G); x=zeros(1,2*L+1); s1l=zeros(1,2*L+1); s2l=zeros(1,2*L+1); for l=-L:1:L f=l/(N*Tb); pl=sqrt(Eb/Tb)*Tb*sinc(f*Tb); Hf=1;%ex
www.eeworm.com/read/379001/9211120

txt mcukaifang.txt

因为工作的需要,要在单片机上实现开根号的操作。目前开平方的方法大部分是用牛顿迭代法。我在查了一些资料以后找到了一个比牛顿迭代法更加快速的方法。不敢独享,介绍给大家,希望会有些帮助。 1.原理 因为排版的原因,用pow(X,Y)表示X的Y次幂,用B[0],B[1],...,B[m-1]表示一个序列, 其中[x]为下标。 假设: B[x],b[x]都是二进制序列,取值0或1 ...