C++ print_vector函数代码示例

int main() {
    Vector *A = make_vector(4);
    consecutive_vector(A);
    printf("A\n");
    print_vector(A);

    Vector *B = make_vector(4);
    increment_vector(B, 1);
    printf("B\n");
    print_vector(B);

    Vector *C = add_vector_func(A, B);
    printf("A + B\n");
    print_vector(C);

    free_vector(A);
    free_vector(B);
    free_vector(C);

    return 0;
}

void to_matrix(Circuit* c,gsl_matrix** A_ptr,gsl_vector** b_ptr)
{
	int w=c->ccount+c->vcount;
	(*A_ptr)=gsl_matrix_calloc(w,w);
	(*b_ptr)=gsl_vector_calloc(w);
	gsl_matrix * A=*A_ptr;
	gsl_vector * b=*b_ptr;
	if(A==NULL||b==NULL){
		printf("ERROR, UNABLE TO ALLOCATE MEMORY FOR MATRIX CONVERSION\n");
		if(A!=NULL){
			gsl_matrix_free(A);
			A=NULL;
		}
		if(b!=NULL){
			gsl_vector_free(b);
			b=NULL;
		}
		return;
	}
	int i;
	int j;
	for(i=0;i<c->ccount;i++)
	{
		Component* edge=c->components+i;
		for(j=0;j<c->vcount-1;j++){
			if(edge->A==c->vertices[j].id){
				gsl_matrix_set(A,j,i,-1.0);
			}
			if(edge->B==c->vertices[j].id){
				gsl_matrix_set(A,j,i,1.0);
			}
		}
	}
	gsl_matrix_view voltage_view=gsl_matrix_submatrix(A,c->vcount-1,c->ccount,c->ccount,c->vcount);
	gsl_matrix* voltage=&voltage_view.matrix;
	for(i=0;i<c->ccount;i++){
		for(j=0;j<c->vcount;j++){
			if(c->vertices[j].id==c->components[i].A)gsl_matrix_set(voltage,i,j,-1);
			if(c->vertices[j].id==c->components[i].B)gsl_matrix_set(voltage,i,j,1);
		}
		if(c->components[i].type==RESISTOR)
		{
			gsl_matrix_set(A,c->vcount+i-1,i,*(double *)c->components[i].data);
		}
		if(c->components[i].type==BATTERY)
		{
			gsl_vector_set(b,c->vcount+i-1,*(double *)c->components[i].data);
		}
	}
	gsl_matrix_set(A,w-1,w-1,1);
	print_matrix(voltage);
	print_vector(b);
}

void swap(int vector[], int element_a, int element_b) {
	int place_holder;

	if (vector[element_a] > vector[element_b]) {
		print_vector(vector);
		print_left_right(element_a, element_b);

		place_holder = vector[element_a];
		vector[element_a] = vector[element_b];
		vector[element_b] = place_holder;
	}
}

int load_key_from_file(char *gkey){
	FILE *fp;
	fp = fopen(KEY_FILE, "rb");
	int read=fread(gkey,sizeof(char),GCRY_KEYLEN,fp);
	fclose(fp);
	if(read==GCRY_KEYLEN){
		printf("\n clave cargada\n");
		print_vector(gkey,GCRY_KEYLEN);
		return 0;
	}
	return -1;
}

int main()
{
    std::function<void()> foo = []() {};

    std::vector<int> vec = { 1,2,3,4,5,6,7,8,9,10 };
    std::transform(vec.begin(), vec.end(), vec.begin(), std::bind(std::multiplies<int>(), std::placeholders::_1, 2));

    std::vector< std::function<void()> > function_queue = { std::bind(print_vector, vec),[]() {std::cout << "\n"; }, [&vec]() {print_vector(vec); } };
    print_vector(vec);

    return 0;
}

/* write a solar system state to file */
void print_system(FILE* file, const System* sys)
{
	int count = sys->nplanets;
	fprintf(file, "%d " FLOAT_PRINTF_FORMAT " ",
			count, sys->cur_step * sys->time_step);
	for(int i = 0; i < sys->nplanets; i++)
	{
		fprintf(file, " ");
		print_vector(file, sys->planets[i].position);
		fprintf(file, i == count - 1 ? "\n" : " ");
	}
}

int
main(void)
{
  complex v[N], v1[N], scratch[N];
  int k;

  /* Fill v[] with a function of known FFT: */
  for(k=0; k<N; k++) {
    v[k].Re = 0.125*cos(2*PI*k/(double)N);
    v[k].Im = 0.125*sin(2*PI*k/(double)N);
    v1[k].Re =  0.3*cos(2*PI*k/(double)N);
    v1[k].Im = -0.3*sin(2*PI*k/(double)N);
  }
    
  /* FFT, iFFT of v[]: */
  print_vector("Orig", v, N);
  fft( v, N, scratch );
  print_vector(" FFT", v, N);
  ifft( v, N, scratch );
  print_vector("iFFT", v, N);

  /* FFT, iFFT of v1[]: */
  print_vector("Orig", v1, N);
  fft( v1, N, scratch );
  print_vector(" FFT", v1, N);
  ifft( v1, N, scratch );
  print_vector("iFFT", v1, N);

  exit(EXIT_SUCCESS);
}

int main(int argc, char *argv[]){
	
	srand (time(NULL));
	int i, j, z;
	int tamanio = 400;

	float* vectorA;
	float* vectorB;
	int resultado = 0;
	double startwtime, endwtime;
	int myrank, size;

	MPI_Init(&argc, &argv);
	MPI_Comm_rank(MPI_COMM_WORLD, &myrank);
	MPI_Comm_size(MPI_COMM_WORLD, &size);

	vectorA = get_vector(tamanio);
	vectorB = get_vector(tamanio);

	if(tamanio <= 15) { //Mostramos hasta vectores de 15 elementos	
		print_vector ( vectorA, tamanio);
		print_vector ( vectorB, tamanio);
	}

	startwtime = MPI_Wtime();
	
	for(i = 0; i < tamanio; i++)//cada elemento del vector
    {
    	resultado += vectorA[i]*vectorB[i];     
   	}

	endwtime = MPI_Wtime();
	printf("Tiempo de ejecucion: %f, usando %d+1 maquinas\n", endwtime - startwtime, size - 1);	

	printf("\nEl resultado del producto escalar de los vectores es: %d\n\n", resultado);	  
	MPI_Finalize();	

	return 0;

}

int main ()
{
    typedef std::vector<int, std::allocator<int> > Vector;

    const Vector::value_type d1[] = { 1, 2, 3, 4 };
    const Vector::value_type d2[] = { 1, 3, 2, 4 };

    // Set up two vectors.
    Vector v1 (d1 + 0, d1 + sizeof d1 / sizeof *d1);
    Vector v2 (d2 + 0, d2 + sizeof d2 / sizeof *d2);

    // Make heaps.
    std::make_heap (v1.begin (), v1.end ());
    std::make_heap (v2.begin (), v2.end (), std::less<int>());

    // v1 = (4, x, y, z)  and  v2 = (4, x, y, z)

    // Note that x, y and z represent the remaining values in the
    // container (other than 4).  The definition of the heap and heap
    // operations  does not require any particular ordering
    // of these values.

    // Copy both vectors to cout.
    print_vector (std::cout, v1);
    print_vector (std::cout, v2);

    // Now let's pop.
    std::pop_heap (v1.begin (), v1.end ());
    std::pop_heap (v2.begin (), v2.end (), std::less<int>());

    print_vector (std::cout, v1);
    print_vector (std::cout, v2);

    // And push.
    std::push_heap (v1.begin (), v1.end ());
    std::push_heap (v2.begin (), v2.end (), std::less<int>());

    print_vector (std::cout, v1);
    print_vector (std::cout, v2);

    // Now sort those heaps.
    std::sort_heap (v1.begin (), v1.end ());
    std::sort_heap (v2.begin (), v2.end (), std::less<int>());

    print_vector (std::cout, v1);
    print_vector (std::cout, v2);

    return 0;
}

int main(void) {
	int vector[VECTOR_LENGTH], element;

	for (element = 0; element < VECTOR_LENGTH; ++element) {
		srandomdev();
		vector[element] = random() % 10;
	}

	quick_sort(vector, 0, VECTOR_LENGTH - 1);
	print_vector(vector);

	return 0;
}

static void vector_insert2(c_vector * p)
{
    c_vector vt;
    __c_vector(&vt, int_comparer);
    
    c_vector_insert2(&vt, 
                    c_vector_begin(&vt), 
                    c_vector_begin(p),
                    c_vector_end(p));
    printf("after insert2\n");
    print_vector(&vt);
    __c_rotcev(&vt);    
}

int main() {
    int size_vector = 0, maximun_element = 0, *my_vector_oficial, *my_vector_index, size_index = 0, element;
    int position_index = 0, position_oficial = 0;
   	size_vector = inserting_element();
   	size_index = sqrt(size_vector);
   	maximun_element = inserting_maximun_element();
   	
   	while(maximun_element < size_vector) {
   		maximun_element = inserting_maximun_element();
   	}
    my_vector_oficial = initializing_vector(size_vector, maximun_element);
    
    selection_sort(my_vector_oficial, size_vector);
    print_vector(my_vector_oficial, size_vector);
    my_vector_index = initializing_vector_index(my_vector_oficial, size_vector);

    printf("\nIndice\n");
    print_vector(my_vector_index, size_index);
    printf("Insira o elemento que deseja buscar: ");
    scanf("%d", &element);
    
    position_index = search_element_index(my_vector_index, size_index, element);

    if (presence_in_vector(my_vector_oficial, size_vector, element) == false) {
    	position_index = -1;
    }

    if (presence_in_vector(my_vector_oficial, size_vector, element) == true && 
    	element > *(my_vector_index+(size_index-1))) {
    	position_index = size_index-1;
    }

    position_oficial = indexed_search(my_vector_oficial, my_vector_index, size_vector, position_index, element);
    printf("Posição no vetor de indice: %d\n", position_index);
    printf("Posição no vetor principal: %d\n", position_oficial);

    printf("\n");
    return 0;
}

void c_FourierTransfrom::demo(void)
{
    Mat image = imread("../../data/lena.jpg", CV_LOAD_IMAGE_COLOR);
    vector<Mat> images;
    split(image, images);
    Mat data(Mat_<t_Real>(images[0]) / 255.0);
    t_Real *p_in = data.ptr<t_Real>(0), *p_out;
    size_t n_data = image.cols;
    c_FourierTransfrom ft;
    ft.fftw_complex_1d(p_in, n_data, p_out);
    print_vector(p_out, n_data);
    return;
}

int main()
{
    std::vector<std::vector<char>> board = {
        {'o','a','a','n'},
        {'e','t','a','e'},
        {'i','h','k','r'},
        {'i','f','l','v'}
    };

    std::vector<std::string> dictionary = {
        "oath","pea","eat","rain"
    };

    std::vector<std::string> result = find_words(board, dictionary);
    std::cout << "Board:" << std::endl;
    print_board(board);
    std::cout << "Dictionary:" << std::endl;
    print_vector(dictionary);
    std::cout << "Result:" << std::endl;
    print_vector(result);
    return 0;
}

void print_root_stack()
{
    printf("[\n");

    int64_t** rootstack_work_ptr = (int64_t**)rootstack_begin;
    while ((void*)rootstack_work_ptr < (void*)rootstack_ptr)
    {
        print_vector(*rootstack_work_ptr);
        printf("---\n");
        rootstack_work_ptr++;
    }
    printf("]\n");
}