代码搜索:sequence

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

代码结果 10,000
www.eeworm.com/read/378857/9214436

m despread.m

% despread.m % % Data despread function. % Programmed by yixiongshu.2006.8.9 function [iout,qout]=despread(idata,qdata,code1) % % idata : ich data sequence. % qdata : qch data sequence. % iout
www.eeworm.com/read/181817/9236160

txt oracle数据库的创建文档 .txt

create table books ( ID number(3), BookName varchar2(20), Press varchar2(20), Author varchar2(20), PressDate Date, Price number(5,2), Com varchar2(20), books_count number(2), borrowed_count n
www.eeworm.com/read/377747/9263252

txt oracle数据库的创建文档 .txt

create table books ( ID number(3), BookName varchar2(20), Press varchar2(20), Author varchar2(20), PressDate Date, Price number(5,2), Com varchar2(20), books_count number(2), borrowed_count n
www.eeworm.com/read/377683/9266016

test alias.test

# 2008 August 28 # # The author disclaims copyright to this source code. In place of # a legal notice, here is a blessing: # # May you do good and not evil. # May you find forgiveness for yours
www.eeworm.com/read/377596/9269955

m despread.m

% Program 5-8 % despread.m % % Data despread function. % Programmed by yixiongshu.2006.8.9 function [iout,qout]=despread(idata,qdata,code1) % % idata : ich data sequence. % qdata : qch data se
www.eeworm.com/read/377407/9277735

c execute_act.c

/* * $Id: execute_act.c 1272 2007-05-09 16:26:20Z mhe $ */ #include #include #include "lstm.h" #include "execute_act.h" void execute_act() { int len; //,i,j,k; len =
www.eeworm.com/read/376923/9300508

m xiaospectra30m.m

function [] = XiaoSpectra30M(Arr1,Arr2); %--------------------------------------------------------------------- % You should input two array ,they must have the same length ,if not , % there will
www.eeworm.com/read/180567/9302222

java stopwait.java

import datalink.*; public class Stopwait extends Protocol { Packet buffer; // to store outstanding packet in case of time out int frameToSend; // sequence number to sue for curren
www.eeworm.com/read/376666/9310660

cpp quicksort.cpp

#include #include #define MAX 255 int R[MAX]; int Partition(int i,int j) {/* 调用Partition(R,low,high)时,对R[low..high]做划分,*/ /* 并返回基准记录的位置 */ int pivot=R[i];
www.eeworm.com/read/179335/9360442

tex classseq__instance.tex

\section{seq\_\-instance$$ Class Template Reference} \label{classseq__instance}\index{seq_instance@{seq\_\-instance}} generic sequence instance class. {\tt \#include $