代码搜索：array
找到约 10,000 项符合「array」的源代码
代码结果 10,000
www.eeworm.com/read/418342/10952703
m imstack2vectors.m
function [X, R] = imstack2vectors(S, MASK)
%IMSTACK2VECTORS Extracts vectors from an image stack.
% [X, R] = imstack2vectors(S, MASK) extracts vectors from S, which
% is an M-by-N-by-n stack ar
www.eeworm.com/read/272512/10955261
h zichx.h
/*
* 用于判断是不是一个关键词
* word char 要判断的词
* return 是关键词返回!=0，否则返回0;
*/
int is_keyword(char word[])
{
int i = 0;
for (i=0;i
www.eeworm.com/read/417350/10993145
txt 05-01.txt
>> str='I have many good friends!'
str =
I have many good friends!
>> whos
Name Size Bytes Class
EXPLODE 1x5 40 double array
F1
www.eeworm.com/read/417152/11002118
m checkphase.m
function word = checkPhase(word, D30Star)
%Checks the parity of the supplied 30bit word.
%The last parity bit of the previous word is used for the calculation.
%A note on the procedure is supplied
www.eeworm.com/read/469590/6932562
readme
Simple RPC program that adds a variable number of integers
(sent as a variable length array).
This RPC program supports 1 remote procedure:
vadd : adds a bunch of ints and returns the int sum.
Th
www.eeworm.com/read/208134/6942772
java depot.java
package chc;
import shared.Inducer;
/** Depot functions as a wrapper for multiple DataDistributors for
* job farms. On the first call for a data file the data is loaded into
* memory, for every
www.eeworm.com/read/208134/6942793
java breeder.java
package chc;
/** Breeder holds all algorithmns necessary for Breeding a population
* of Hypotheses to produce the next generation. Two Hypotheses are
* only able to breed if they differ by the t
www.eeworm.com/read/131205/6955697
cpp sparsearraytest.cpp
//
// FILE: SparseArrayTest.cpp
//
// Copyright (c) 1997 by Aaron Michael Cohen and Mike Woodring
//
/////////////////////////////////////////////////////////////////////////
#include "SparseA