代码搜索：流驱动
找到约 10,000 项符合「流驱动」的源代码
代码结果 10,000
www.eeworm.com/read/433381/7935432
cpp interpolationsmoothisometry.cpp
//InterpolationSmoothIsometry 光滑等距插值
#include //输入输出流头文件
#include "Interpolation.h" //插值头文件
void main()
{
int k(-1);
double t, x(-1.0), h(0.2);
double y[11] =
{
www.eeworm.com/read/433381/7935444
cpp interpolationfractionnotisometry.cpp
//InterpolationFractionNotIsometry.cpp
//连分式不等距插值
#include //输入输出流头文件
#include "Interpolation.h" //插值头文件
void main()
{
double t, s;
double x[10] =
{
-1.0, -0.8, -
www.eeworm.com/read/143098/12898991
java audioplayer.java
package tcpSoundCommunication;
import javax.sound.sampled.*;
import java.net.*;
import java.io.*;
/**
* 得到声音流的类，封装一个播放器程序
* Title:
* Description:
* Copyright: Copyri
www.eeworm.com/read/140740/13064172
cpp interpolationsmoothisometry.cpp
//InterpolationSmoothIsometry 光滑等距插值
#include //输入输出流头文件
#include "Interpolation.h" //插值头文件
void main()
{
int k(-1);
double t, x(-1.0), h(0.2);
double y[11] =
{
www.eeworm.com/read/140740/13064179
cpp interpolationfractionnotisometry.cpp
//InterpolationFractionNotIsometry.cpp
//连分式不等距插值
#include //输入输出流头文件
#include "Interpolation.h" //插值头文件
void main()
{
double t, s;
double x[10] =
{
-1.0, -0.8, -
www.eeworm.com/read/240574/13212951
m rand_bits.m
%******************** end of file ******************************
%子程序：1.cp_bits.m
% 数据流产生
function [bits]=rand_bits(number)
%number = 16
%bits=rand(1,number)>0.5; % 产生二进制数据流
for k = 1 : number
www.eeworm.com/read/133698/5903605
java fileoperation.java
import java.io.*;
public class FileOperation
{
public static void main(String args[])
{
try
{ //把标准输入通过InputStreamReader由二进制数据流变成字符数据流
BufferedReader in=new BufferedReader(new In
www.eeworm.com/read/162607/6330921
java downloadingfileclient.java
/**
* 下载文件服务器
* */
package downloadingfile;
import java.net.*;
import java.io.*;
public class DownloadingFileClient
{
//准备所需的变量
private Socket socket = null;
//指向服务器的输出流
PrintWriter PWSer
www.eeworm.com/read/408164/11403072
cpp seqsearchmain.cpp
//SeqSearchMain.cpp
#include //引入输入输出流
using namespace std;
int SeqSearch1(int r[], int n, int k)
{
r[0]=k ; //设置哨兵
int i=n,count=0;
while (r[i]!=k) //