代码搜索：myself
找到约 710 项符合「myself」的源代码
代码结果 710
www.eeworm.com/read/291457/8417170
asm 从机通讯程序.asm
address EQU 30H;从机地址
myself EQU 31H;本机地址
sadd EQU 32H;传送数据起始地址
bitlong EQU 33H;传送数据块长度
ORG 0000H
AJMP START
ORG 0023H
LJMP INSE
www.eeworm.com/read/291457/8417172
asm 主机通讯程序.asm
address EQU 30H;从机地址
;myself EQU 31H;本机地址
sadd EQU 32H;传送数据起始地址
bitlong EQU 33H;传送数据块长度
ORG 0000H
AJMP START
ORG 0023H
LJMP INS
www.eeworm.com/read/241438/13144467
h seldefbt.h
// binaty tree defined by myself
//本定义中采用的老师的queue定义，用数组实现，希望自己用链表实现
# ifndef SELF_DEFINE_BT
# define SELF_DEFINE_BT
#include
//# include"Queue.h"
template
class Que
www.eeworm.com/read/26981/974908
map sf07p07v00.map
Optimizing Linkage Editor (V.9.01.01.000) 22-Jun-2007 15:36:24
*** Options ***
-subcommand=F:\MyWordFiles\JIANGSUMETER\PROGRAM\MYSELF\SF07P07V00\SF07P07V00\Debug_H8_Tiny_SLP_E8_SYSTEM_30
www.eeworm.com/read/26981/974918
h8c resetprg.h8c
-cpu=300L
-object="F:\MyWordFiles\JIANGSUMETER\PROGRAM\MYSELF\SF07P07V00\SF07P07V00\Debug_H8_Tiny_SLP_E8_SYSTEM_300L\resetprg.obj"
-debug
-nolist
-chgincpath
"F:\MyWordFiles\JIANGSUMETER\PROGRAM\
www.eeworm.com/read/26981/974923
h8c multirate.h8c
-cpu=300L
-object="F:\MyWordFiles\JIANGSUMETER\PROGRAM\MYSELF\SF07P07V00\SF07P07V00\Debug_H8_Tiny_SLP_E8_SYSTEM_300L\MultiRate.obj"
-debug
-nolist
-chgincpath
"F:\MyWordFiles\JIANGSUMETER\PROGRAM
www.eeworm.com/read/26981/974924
h8c communicate.h8c
-cpu=300L
-object="F:\MyWordFiles\JIANGSUMETER\PROGRAM\MYSELF\SF07P07V00\SF07P07V00\Debug_H8_Tiny_SLP_E8_SYSTEM_300L\communicate.obj"
-debug
-nolist
-chgincpath
"F:\MyWordFiles\JIANGSUMETER\PROGR
www.eeworm.com/read/283355/4080060
patch sysdep-cancel-arm-1.2-1.6.patch
I haven't built glibc-2.3.2 for arm myself, but
http://sources.redhat.com/ml/bug-glibc/2003-05/msg00076.html and
http://www.linux.org.uk/pipermail/linux-arm/2003-November/006560.html
give me the disti
www.eeworm.com/read/367675/2837940
txt 465.txt
发信人: helloboy (hello), 信区: DataMining
标 题: matrix calculation
发信站: 南京大学小百合站 (Thu Oct 24 09:19:06 2002), 站内信件
I am devoting myself into a shortest path solution problem.
In my research, I came u
www.eeworm.com/read/430555/8738930
m bpsk.m
% function Y_Y=BPSK_myself_VI()
%用自己编的卷积码编解函数cnv_encd、viterbi仿真OFDM
clear;
% tic
N=64; %The number of carriers
% h=gausComplex(1,3);
h=[1];
%h=[0.407,0.815,0.407];
L=length(h);
v=l