本文整理汇总了C++中print_vector函数的典型用法代码示例。如果您正苦于以下问题:C++ print_vector函数的具体用法?C++ print_vector怎么用?C++ print_vector使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。
在下文中一共展示了print_vector函数的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。
示例1: main
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;
}
开发者ID:amuthaOlin,项目名称:SoftwareSystems,代码行数:21,代码来源:vector.c
示例2: to_matrix
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);
}
开发者ID:mabruckner,项目名称:Portable-Physics-Applications,代码行数:53,代码来源:Circuit.c
示例3: swap
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;
}
}
开发者ID:DeadDork,项目名称:learning_c,代码行数:12,代码来源:qsort_1.c
示例4: load_key_from_file
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;
}
开发者ID:RootedWarfare,项目名称:Atropos-Flight-Control,代码行数:12,代码来源:udp_emisora.c
示例5: main
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;
}
开发者ID:maxrake,项目名称:CppCourse,代码行数:12,代码来源:Source.cpp
示例6: print_system
/* 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" : " ");
}
}
开发者ID:dezgeg,项目名称:PlanetSim,代码行数:13,代码来源:planet.c
示例7: main
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);
}
开发者ID:jmccormack200,项目名称:DSP,代码行数:30,代码来源:otherfft.c
示例8: main
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;
}
开发者ID:Miguelrn,项目名称:MPI,代码行数:40,代码来源:ejercicio6.c
示例9: main
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;
}
开发者ID:Flameeyes,项目名称:stdcxx,代码行数:49,代码来源:heap_ops.cpp
示例10: main
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;
}
开发者ID:DeadDork,项目名称:learning_c,代码行数:13,代码来源:qsort_1.c
示例11: vector_insert2
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);
}
开发者ID:LiZhaoxing,项目名称:hostapd,代码行数:13,代码来源:t_vector.c
示例12: main
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;
}
开发者ID:filiperibeiro77,项目名称:EDA2,代码行数:39,代码来源:main_04.c
示例13: imread
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;
}
开发者ID:xiehao,项目名称:Image-Vectorization,代码行数:13,代码来源:fourier_transfrom.cpp
示例14: main
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;
}
开发者ID:mandliya,项目名称:algorithms_and_ds_playground,代码行数:22,代码来源:word_search.cpp
示例15: print_root_stack
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");
}
开发者ID:osa1,项目名称:racket.rkt,代码行数:13,代码来源:runtime.c
示例16: print_tsb_link
static void
print_tsb_link(tsb_link_vector_el_t *tsb_linkp, void *data) {
tsb_link_t *tsb_link = *tsb_linkp;
gf_say(VERBOSE_DEBUG,
"TSB_LINK: name = '%s', lineno=%d\n", tsb_link->name,
tsb_link->lineno);
gf_say(VERBOSE_DEBUG,
" start_addr = 0x%llx\n", tsb_link->start_addr);
gf_say(VERBOSE_DEBUG, "\n");
print_vector(&(tsb_link->entries));
}
开发者ID:jiangxilong,项目名称:OpenSPARC_T1,代码行数:13,代码来源:tsb_link.c
示例17: while
int mipb_frac::run()
{
bool targets=false;
for (int user=0;user<lines;user++) {
if (_rate_targets[user] != NOT_SET)
targets=true;
}
if (targets) {
for (int user=0;user<lines;user++) {
if (_rate_targets[user] == NOT_SET)
continue;
_w_min[user]=0;
_w_max[user]=1e-5;
while(1) {
reset_data();
load();
print_vector(_w,"_w");
print_vector(_b_total,"_b_total");
//getchar();
if (_b_total[user] > _rate_targets[user]) {
_w_max[user] = _w[user];
}
else if (_b_total[user] < _rate_targets[user]) {
_w_min[user] = _w[user];
}
if (abs(_b_total[user] - _rate_targets[user]) < _rate_tol) {
printf("Converged on line %d\n",user);
break;
}
_w[user] = (_w_max[user]+_w_min[user])/2;
}
}
}
else
load();
init_lines();
calculate_snr();
}
开发者ID:andrewbolster,项目名称:multiuserDSM,代码行数:38,代码来源:mipb_frac.c
示例18: vector_less
static void vector_less(c_vector * p)
{
c_iterator iter;
int * old;
c_vector vt;
__c_vector(&vt, int_comparer);
print_vector(&vt);
print_vector(p);
printf(c_vector_less(&vt, p) ? "IS less\n" : "NOT less\n");
create_with_push_back(&vt);
print_vector(&vt);
print_vector(p);
printf(c_vector_less(&vt, p) ? "IS less\n" : "NOT less\n");
iter = c_vector_begin(&vt);
old = (int*)ITER_REF(iter);
ITER_REF_ASSIGN(iter, &array[5]);
print_vector(&vt);
print_vector(p);
printf(c_vector_less(&vt, p) ? "IS less\n" : "NOT less\n");
ITER_REF_ASSIGN(iter, old);
ITER_INC_N(iter, 3);
old = (int*)ITER_REF(iter);
ITER_REF_ASSIGN(iter, &array[0]);
print_vector(&vt);
print_vector(p);
printf(c_vector_less(&vt, p) ? "IS less\n" : "NOT less\n");
c_vector_clear(&vt);
c_vector_clear(p);
print_vector(&vt);
print_vector(p);
printf(c_vector_less(&vt, p) ? "IS less\n" : "NOT less\n");
__c_rotcev(&vt);
}
开发者ID:LiZhaoxing,项目名称:hostapd,代码行数:38,代码来源:t_vector.c
示例19: main
void main(int argc, char **argv)
{
int n = 3, iter = 0;
if(argc > 1)
n = atoi(argv[1]);
double stop, *tmp, (*A)[n], *b, *x0, *x1;
init(n, &A, &b, &x0, &x1);
printf("Matrix A:\n");
print_matrix(n, A);
printf("\nVector b:\n");
print_vector(n, b);
printf("\nInitial Guess of Vector x:\n");
print_vector(n, x1);
do
{
stop = 0.0;
for (int i = 0; i < n; i++)
{
x1[i] = 0.0;
for (int j = 0; j < n; j++)
{
if(i != j)
x1[i] += A[i][j] * x0[j];
}
x1[i] = (b[i] - x1[i]) / A[i][i];
stop += pow(x1[i] - x0[i], 2.0);
}
tmp = x1; x1 = x0; x0 = tmp;
iter++;
} while((sqrt(stop) > EPSILON) && (iter < MAX_ITER));
printf("\nSolution Vector x after %d Iterations:\n", iter);
print_vector(n, x1);
}
开发者ID:mayankTUM,项目名称:Parallel-Programming,代码行数:38,代码来源:jacobi.c
示例20: mesh_generate
static void mesh_generate(){
// double ppwl = param->factor / param->freq;
// double myfactor = param->factor;
Octree tree = octor_newtree();
tree.root = refine_tree(&tree.root, &toexpand, &query_model);
vector<Element> elements;
unordered_map<int , Node> nodes;
elements = traverse_tree(&tree.root, elements);
print_vector(elements, "/Users/kelicheng/Desktop/mymesh.txt");
nodes = extract_mesh(elements);
print_nodes(nodes, "/Users/kelicheng/Desktop/mynodes.txt");
}
开发者ID:KeliCheng,项目名称:hercules_plus,代码行数:14,代码来源:Psolve.cpp
注:本文中的print_vector函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。 |
请发表评论