代码搜索：construct
找到约 6,584 项符合「construct」的源代码
代码结果 6,584
www.eeworm.com/read/187145/8853195
c rvkernel.c
#if (0)
******************************************************************************
Filename :
Description:
******************************************************************************
www.eeworm.com/read/185632/8995429
java swingworker.java
import javax.swing.SwingUtilities;
public abstract class SwingWorker {
private Object value;
private Thread thread;
private static class ThreadVar {
private Thread thread;
www.eeworm.com/read/380937/9122011
c tree.c
#include
#include
struct tree
{
char info;
struct tree *left;
struct tree *right;
};
struct tree *root; /*树的第一个结点*/
struct tree *construct(struct tree *root, stru
www.eeworm.com/read/281848/9130195
java c7.java
// reusing/Ex7/C7.java
// TIJ4 Chapter Reusing, Exercise 7, page 246
/* Modify Exercise 5 so that A and B have constructors with arguments instead
* of default constructors. Write a constructor for
www.eeworm.com/read/281848/9130210
java c.java
// reusing/Ex5/C.java
// TIJ4 Chapter Reusing, Exercise 5, page 245
/* Create two classes, A and B, with default constructors (empty argument
* lists) that announce themselves. Inherit a new class
www.eeworm.com/read/180486/9305337
m dvbbase.m
function h = dvbbase(R)
%DVBBASE Construct a DVB-S.2 LDPC base object.
%
% Inputs:
% R - Code rate
% Copyright 1996-2005 The MathWorks, Inc.
% $Revision: 1.1.6.1 $ $Date: 2005/12/12
www.eeworm.com/read/180486/9305372
m ldpcbase.m
function h = ldpcbase(H)
%LDPCBASE Construct an LDPC base object.
%
% Inputs:
% H - Parity check matrix (sparse matrix)
% Copyright 1996-2005 The MathWorks, Inc.
% $Revision: 1.1.6.1
www.eeworm.com/read/179006/9379400
java client.java
package com.javapatterns.builder.simplified2;
public class Client
{
private static Builder builder;
static public void main(String[] args)
{
builder = new Builder();
builde
www.eeworm.com/read/177639/9443441
m fenxin_tree.m
% File: tree.m
function tree(x0,y0,m,n,i)
% this function is to construct a“分形树”
% x0,y0是起始坐标，
% m与每次增长的长度有关，一般m>1,但如果太大的话m^(1-n）收缩过快分形树长不了几次就会因长度小于分辨率而无法显示
% n与分形树增长的次数有关，一共增长 20-n 次
% i与图形的样
www.eeworm.com/read/372762/9494311
c tree.c
#include
#include
struct tree
{
char info;
struct tree *left;
struct tree *right;
};
struct tree *root; /*树的第一个结点*/
struct tree *construct(struct tree *root, stru