代码搜索:Microphone array
找到约 10,000 项符合「Microphone array」的源代码
代码结果 10,000
www.eeworm.com/read/458682/7291362
sh copyarray.sh
#! /bin/bash
# CopyArray.sh
#
# This script written by Michael Zick.
# Used here with permission.
# How-To "Pass by Name & Return by Name"
#+ or "Building your own assignment statement".
CpArray_M
www.eeworm.com/read/454938/7381239
c main2.c
// #include
#include
#include "Array.C"
/**
**
[ 0 ] ia: 0 ca: a da: 0
[ 1 ] ia: 1 ca: b da: 1.75
[ 2 ] ia: 2 ca: c da: 3.5
[ 3 ] ia: 3 ca:
www.eeworm.com/read/454938/7381329
cpp min4.cpp
// Section 10.3
// $ CC min4.cpp
/*
minimum value is: 3
*/
#include "Array.h"
#include "ArrayRC.h"
#include "Array.cpp"
#include "ArrayRC.cpp"
template
Type min4
www.eeworm.com/read/454938/7381436
c main01.c
#include "Array.C"
#include "try_array.C"
#include
int main()
{
static int ia[] = { 12,7,14,9,128,17,6,3,27,5 };
static double da[] = {12.3,7.9,14.6,9.8,128.0 };
static s
www.eeworm.com/read/453496/7418311
c sum_2d.c
#include
long sum_array(int array[], int elements)
{
long sum = 0;
int i;
for (i = 0; i < elements; i++)
sum += array[i];
return(sum);
}
void main(voi
www.eeworm.com/read/453496/7418357
c hugeint.c
#include
#include
void main (void)
{
long int i;
int huge *big_array;
if ((big_array = (int huge *) halloc (100000L,
sizeof(long int))) == NULL)
www.eeworm.com/read/452695/7436260
c ex9_02.c
/* Exercise 9.2 Implementing arithmetic and array functions */
#include
double add(double a, double b); /* Returns a+b */
double subtract(double a, double b); /* Returns a-b */
double
www.eeworm.com/read/451329/7467100
c sum_2d.c
#include
long sum_array(int array[], int elements)
{
long sum = 0;
int i;
for (i = 0; i < elements; i++)
sum += array[i];
return(sum);
}
void main(voi
www.eeworm.com/read/451329/7467146
c hugeint.c
#include
#include
void main (void)
{
long int i;
int huge *big_array;
if ((big_array = (int huge *) halloc (100000L,
sizeof(long int))) == NULL)
www.eeworm.com/read/450595/7480689
c string_lib.c
/******************************************************************************
* *
* **********