代码搜索：Microphone array
找到约 10,000 项符合「Microphone array」的源代码
代码结果 10,000
www.eeworm.com/read/144216/5752347
t tie-stdarray.t
#!./perl
BEGIN {
chdir 't' if -d 't';
@INC = '.';
push @INC, '../lib';
}
use Tie::Array;
tie @foo,Tie::StdArray;
tie @ary,Tie::StdArray;
tie @bar,Tie::StdArray;
require "op/array.t"
www.eeworm.com/read/143582/5756684
cpp arraysum.cpp
void MySub()
{
char A = 'A';
int B = 10;
char name[20];
name[0] = 'B';
double c = 1.2;
}
int ArraySum( int array[], int count )
{
int sum = 0;
for(int i = 0; i < count; i++)
www.eeworm.com/read/133066/5908325
java arraygrowtest.java
/**
@version 1.01 2004-02-21
@author Cay Horstmann
*/
import java.lang.reflect.*;
import java.util.*;
public class ArrayGrowTest
{
public static void main(String[] args)
{
www.eeworm.com/read/130240/5962832
java arraygrowtest.java
/**
@version 1.01 2004-02-21
@author Cay Horstmann
*/
import java.lang.reflect.*;
import java.util.*;
public class ArrayGrowTest
{
public static void main(String[] args)
{
www.eeworm.com/read/129250/5974568
cpp arraysum.cpp
void MySub()
{
char A = 'A';
int B = 10;
char name[20];
name[0] = 'B';
double c = 1.2;
}
int ArraySum( int array[], int count )
{
int sum = 0;
for(int i = 0; i < count; i++)
www.eeworm.com/read/113176/6136047
java arrayholder.java
//$Id: ArrayHolder.java,v 1.15.2.10 2003/11/24 03:50:45 oneovthafew Exp $
package net.sf.hibernate.collection;
import java.io.Serializable;
import java.lang.reflect.Array;
import java.sql.PreparedSta
www.eeworm.com/read/255407/6291108
cpp main11.cpp
// Section 10.11
// $ CC main11.C
/*
sort array of doubles (size == 10)
< 1.7 5.7 11.7 15.7 19.7 26.7 37.7 48.7 59.7 61.7 >
sort array of ints (size == 16)
< 61 87 154 170 275 426 503
www.eeworm.com/read/487077/6523264
c ctolv.c
#include "CtoLV.h"
// Changes the contents of a 1-D array NOTE LV passes the data as a double*, so no size information is available
// and the additional paramter size tells us how many elements w
www.eeworm.com/read/480077/6676530
asm p11.asm
TITLE 8086 ALP to find sum of numbers in the array for assembler
.model small
.data
ARRAY DB 12H,24H,26H,63H,25H,86H,2FH,33H,10H,35H
SUM DW 0
.code
START: MOV AX,@data
www.eeworm.com/read/479671/6684756
cpp a600ordi.cpp
// nuovi concetti: algoritmo di ordinamento ingenuo
#include
using namespace std;
int main() {
const int n=400;
int i, j, a[n];
srand(time(0));
// Genera array
for (