代码搜索:array

找到约 10,000 项符合「array」的源代码

代码结果 10,000
www.eeworm.com/read/272824/10942807

cpp p4-196.cpp

#include #include #include #define ARRAY_SIZE 10 using namespace std; //利用类模板生成实例 typedef vector < int > IntArray; //显示数组 void put_array(int x[],int size) {
www.eeworm.com/read/272824/10942849

cpp p4-199.cpp

#include #include #include #include #define ARRAY_SIZE 15 using namespace std; //定义整型数的vector容器类 typedef vector IntVector ; //显示数组 void pu
www.eeworm.com/read/272824/10942856

cpp p4-200.cpp

#include #include #include #include #define ARRAY_SIZE 15 using namespace std; //显示数组 void put_array(int x[],int size) { for(int i=0;i
www.eeworm.com/read/295750/6964843

h sharedarray.h

#include "pagesize.h" extern int do_shared_array_work(void); /* We'd like the arrays big enough that the page granularity doesn't * skew the figures */ #define ARRAY_SIZE (CURRENT_PAGE_SIZE * 100)
www.eeworm.com/read/129161/7077904

c pngstub0.c

/* pngstub.c - stub functions for i/o and memory allocation libpng 1.0 beta 1 - version 0.71 For conditions of distribution and use, see copyright notice in png.h Copyright (c) 1995 Gu
www.eeworm.com/read/462831/7194732

php3 14-2.php3

Figure 14-2
www.eeworm.com/read/459924/7262693

i pyfann.i

/* File : fann.i */ %module libfann %include "typemaps.i" %include "stl.i" #ifdef SWIGWIN %include windows.i #define FANN_API __stdcall #endif %{ #include "doublefann.h" #include "fann
www.eeworm.com/read/452964/7428645

txt 例8.4.txt

例8.4 找出一个整型数组中的元素的最大值。 这个问题可以不用类的方法来解决,现在用类来处理,读者可以比较不同方法的特点。 #include using namespace std; class Array_max //声明类 {public: //以下3行为成员函数原型声明 voi
www.eeworm.com/read/452713/7434516

h xt8-5.h

//xt8-5.h(arraymax.h) class Array_max {public: void set_value(); void max_value(); void show_value(); private: int array[10]; int max; };
www.eeworm.com/read/452301/7442145

tb pci_cmd_test.tb

-------------------------------------------------------------------------------- -- -- File : pci_cmd_test.tb -- Last Modification: 06/26/2001 -- -- Created In SpDE Version: SpDE 8.22 -- Author