代码搜索:thread
找到约 10,000 项符合「thread」的源代码
代码结果 10,000
www.eeworm.com/read/131215/7138661
java copythread.java
import java.lang.Thread;
class connectThread extends Thread
{
Ctree ser;
public connectThread(Object ser)
{
this.ser=(Ctree)ser;
}
public void run()
{
ser.down();
www.eeworm.com/read/332978/7142041
java selfmanaged.java
//: concurrency/SelfManaged.java
// A Runnable containing its own driver Thread.
public class SelfManaged implements Runnable {
private int countDown = 5;
private Thread t = new Thread(this)
www.eeworm.com/read/332978/7142101
java basicthreads.java
//: concurrency/BasicThreads.java
// The most basic use of the Thread class.
public class BasicThreads {
public static void main(String[] args) {
Thread t = new Thread(new LiftOff());
www.eeworm.com/read/370166/7149476
java democlientmultiinstant.java
/*
* Copyright (C) 2001 Cooperative Software Systems, Inc.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU Genera
www.eeworm.com/read/464185/7167826
cpp main(linux).cpp
#include
#include
int i;
int j;
static int m = 3;
static int k = 4;
static int n = 2;
int A[3][4];
int B[4][2];
int C[3][2];
void* thread(void * ptr)
{
for (int p
www.eeworm.com/read/464132/7168985
cpp tcpclithr.cpp
#include
#include
#include
#include"../include/mysocket.h"
#include"../include/mythread.h"
#include"../include/TcpCliThr.h"
TcpCliThr::TcpCliThr()
{
ThrSet = new vector
www.eeworm.com/read/462883/7193764
java tomadventuremidlet.java
import javax.microedition.midlet.*;
import javax.microedition.lcdui.*;
/**
* Title:
* Description:
* Copyright: Copyright (c) 2004
* Company: BBMF
* @author
www.eeworm.com/read/462468/7201089
java bulletssprite.java
import javax.microedition.lcdui.*;
import javax.microedition.lcdui.game.*;
import java.io.IOException;
public class BulletsSprite extends Sprite implements Runnable{
private int x, y;
p
www.eeworm.com/read/461110/7233615
cpp bo6-3.cpp
// bo6-3.cpp 二叉树的二叉线索存储(存储结构由c6-3.h定义)的基本操作,包括算法6.5~6.7
void CreateBiThrTree(BiThrTree &T)
{ // 按先序输入线索二叉树中结点的值,构造线索二叉树T。0(整型)/空格(字符型)表示空结点
TElemType ch;
scanf(form,&ch);
if(ch==Nil)