• 设为首页
  • 点击收藏
  • 手机版
    手机扫一扫访问
    迪恩网络手机版
  • 关注官方公众号
    微信扫一扫关注
    公众号

C++ print_number函数代码示例

原作者: [db:作者] 来自: [db:来源] 收藏 邀请

本文整理汇总了C++中print_number函数的典型用法代码示例。如果您正苦于以下问题:C++ print_number函数的具体用法?C++ print_number怎么用?C++ print_number使用的例子?那么恭喜您, 这里精选的函数代码示例或许可以为您提供帮助。



在下文中一共展示了print_number函数的20个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于我们的系统推荐出更棒的C++代码示例。

示例1: draw_time

void draw_time(struct tm *current) {
	print_number(current->tm_hour / 10 % 10, 5, 16);
	print_number(current->tm_hour % 10, 21, 16);
	print_number(10, 35, 15);
	print_number(current->tm_min / 10 % 10, 47, 16);
	print_number(current->tm_min % 10, 63, 16);
}
开发者ID:Siapran,项目名称:Nokia5110LCD,代码行数:7,代码来源:clock.c


示例2: main

int main()
{
    number_t a, b, c;
    int i;

    a = string_to_number("-1.7171");
    b = string_to_number("-17.17");
    c = zero();

    print_number(a);
    printf("\n");
    print_number(b);
    printf("\n");
    c = sub_number(a, b);
    /*
       for(i=-10; i<10; i++) {
       c = make_exp(i);
       print_number(c);
       printf("\n");
       }
       */

    c = mult_num(a, b);
    print_number(c);
    printf("\n");

    return 0;
}
开发者ID:hss440,项目名称:algo1,代码行数:28,代码来源:number_old.c


示例3: run_benchmark

static void run_benchmark(char *name, void (*benchmark)(void *),
                          void (*setup)(void *), void (*teardown)(void *),
                          void *data, int count, int iter) {
    int i;
    double min = HUGE_VAL;
    double sum = 0.0;
    double max = 0.0;
    for (i = 0; i < count; i++) {
        double begin, total;
        if (setup != NULL) {
            setup(data);
        }
        begin = gettimedouble();
        benchmark(data);
        total = gettimedouble() - begin;
        if (teardown != NULL) {
            teardown(data);
        }
        if (total < min) {
            min = total;
        }
        if (total > max) {
            max = total;
        }
        sum += total;
    }
    printf("%s: min ", name);
    print_number(min * 1000000000.0 / iter);
    printf("ns / avg ");
    print_number((sum / count) * 1000000000.0 / iter);
    printf("ns / max ");
    print_number(max * 1000000000.0 / iter);
    printf("ns\n");
}
开发者ID:CommerciumBlockchain,项目名称:Commercium_Deprecated,代码行数:34,代码来源:bench.c


示例4: ft_printf_o2

int				ft_printf_o2(unsigned long nb, t_flags f)
{
	int					len;
	char				*print;
	int					tmp_len;

	len = 0;
	tmp_len = 0;
	print = ft_itoa_base(nb, 8);
	if (f.hashtag == 1 && nb > 0 && f.precision < (int)ft_strlen(print))
		tmp_len += 1;
	if ((int)ft_strlen(print) < f.precision && f.precision >= 0)
		tmp_len += f.precision;
	else
		tmp_len += ft_strlen(print);
	if (tmp_len >= (int)f.len_field)
		len += print_number(print, f, nb);
	else if (f.minus == 1)
		len = minus(len, print, f, nb);
	else
	{
		while (len < (int)f.len_field - tmp_len)
			len += ft_putchar(' ');
		len += print_number(print, f, nb);
	}
	free(print);
	return (len);
}
开发者ID:lnieto-m,项目名称:ft_printf,代码行数:28,代码来源:ft_printf_conversion_lo.c


示例5: print_combination_4

void print_combination_4(void) {
  int n;
  int n2;

  /* run through & print the 2nd number for each digit b/w 0 and 99,
   * excluding combinations already printed (using n2 = n+1). */
  for (n = 0; n <  99; n++) {
    for (n2 = n + 1; n2  < 100; n2++) {

      if (n < 10) {
	print_number(0); /* handle cases where n under 10 by manually printing 0 */
      }

      print_number(n);
      print_char(' ');

      if (n2 < 10) {
	print_number(0); /* handle cases where n2 under 10 by manually printing 0 */
      }

      print_number(n2);
      
      if (n + n2 != 197) {
	print_char(',');
	print_char(' ');
      }
    }
  }
}
开发者ID:ronachong,项目名称:holbertonschool-low_level_programming,代码行数:29,代码来源:6-print_combination_4.c


示例6: switch

/* Render a value to text. */
static char *print_value(cJSON *item,int depth,int fmt,printbuffer *p)
{
	char *out=0;
	if (!item) return 0;
	if (p)
	{
		switch ((item->type)&255)
		{
			case cJSON_NULL:	{out=ensure(p,5);	if (out) strcpy(out,"null");	break;}
			case cJSON_False:	{out=ensure(p,6);	if (out) strcpy(out,"false");	break;}
			case cJSON_True:	{out=ensure(p,5);	if (out) strcpy(out,"true");	break;}
			case cJSON_Number:	out=print_number(item,p);break;
			case cJSON_String:	out=print_string(item,p);break;
			case cJSON_Array:	out=print_array(item,depth,fmt,p);break;
			case cJSON_Object:	out=print_object(item,depth,fmt,p);break;
		}
	}
	else
	{
		switch ((item->type)&255)
		{
			case cJSON_NULL:	out=cJSON_strdup("null");	break;
			case cJSON_False:	out=cJSON_strdup("false");break;
			case cJSON_True:	out=cJSON_strdup("true"); break;
			case cJSON_Number:	out=print_number(item,0);break;
			case cJSON_String:	out=print_string(item,0);break;
			case cJSON_Array:	out=print_array(item,depth,fmt,0);break;
			case cJSON_Object:	out=print_object(item,depth,fmt,0);break;
		}
	}
	return out;
}
开发者ID:duhaifeng,项目名称:c_learn,代码行数:33,代码来源:cjson.c


示例7: ft_printf_x

int				ft_printf_x(va_list ap, t_flags f)
{
	t_len				lenf;
	unsigned long long	nb;
	char				*print;

	lenf.len = 0;
	lenf.tmp_len = 0;
	nb = unsigned_check(ap, f);
	print = ft_itoa_base(nb, 16);
	if (f.hashtag == 1)
		lenf.tmp_len += 2;
	if ((int)ft_strlen(print) < f.precision)
		lenf.tmp_len += f.precision;
	else
		lenf.tmp_len += ft_strlen(print);
	if (lenf.tmp_len >= (int)f.len_field)
		lenf.len += print_number(print, f, nb, f.precision);
	else if (f.minus == 1)
		lenf.len = minus(f, lenf.len, nb, print);
	else
	{
		while (lenf.len < (int)f.len_field - lenf.tmp_len && f.zero != 1)
			lenf.len += ft_putchar(' ');
		lenf.len += print_number(print, f, nb, (int)f.len_field - lenf.tmp_len);
	}
	return (free_ret(print, lenf.len));
}
开发者ID:lnieto-m,项目名称:ft_printf,代码行数:28,代码来源:ft_printf_conversion_x.c


示例8: print_combination_4

/*prints - on one line - all possible combinations of two two-digit numbers*/
void print_combination_4(void)
{
  int i, j, k, l, n1, n2;
  for (i = 0; i <= 9; i++)
    {
      for (j = 0; j < 9; j++)
	{
	  for(k = 0; k <= 9; k++)
	    {
	      for(l = 1; l <= 9; l++)
		{
		
		      n1 = i*10 + j;
		      n2 = k*10 + l;
		     
			if(n2 > n1)
			  {
			    print_number(i);
			    print_number(j);
			    print_char(' ');
			    print_number(k);
			    print_number(l);
			    print_char(',');
			    print_char(' ');
			  }
		    
		}
	    }
	}
    }
}
开发者ID:Praylin,项目名称:holbertonschool-low_level_programming,代码行数:32,代码来源:6-print_combination_4.c


示例9: print_free

static void print_free(unsigned long group, char * bitmap,
		       unsigned long num, unsigned long offset, int ratio)
{
	int p = 0;
	unsigned long i;
	unsigned long j;

	offset /= ratio;
	offset += group * num;
	for (i = 0; i < num; i++)
		if (!in_use (bitmap, i))
		{
			if (p)
				printf (", ");
			print_number((i + offset) * ratio);
			for (j = i; j < num && !in_use (bitmap, j); j++)
				;
			if (--j != i) {
				fputc('-', stdout);
				print_number((j + offset) * ratio);
				i = j;
			}
			p = 1;
		}
}
开发者ID:Gwinel,项目名称:e2fsprogs,代码行数:25,代码来源:dumpe2fs.c


示例10: print_combination_4

/*prints combination of all combinations of 2 two-digit numbers*/
void print_combination_4(void)
{
  int n1, n2;

  for (n1=0; n1<99; n1++)
  {
    for (n2=n1+1; n2<=99; n2++)
    {
      if (n1<10)
      {
	print_char('0');
      }
      print_number(n1);
      print_char(' ');
      if (n2<10)
      {
	print_char('0');
      }
      print_number(n2);
      if (n1 < 98)
      {
	print_char(',');
	print_char(' ');
      }
    }
  }
}
开发者ID:butcallmeJo,项目名称:holbertonschool-low_level_programming,代码行数:28,代码来源:6-print_combination_4.c


示例11: print_combination_1

void print_combination_1(void)
{
  int i;
  print_number(0); /*no comma before this*/
  for (i=1;i<10;i++) /*from 1-9*/
    {
      print_char(',');
      print_char(' ');
      print_number(i);
    }
}
开发者ID:bilalbarki,项目名称:holbertonschool-low_level_programming,代码行数:11,代码来源:1-print_combination_1.c


示例12: print_array

/* print an array */
void print_array(int *array, int n)
{
        int i;

        print_number(array[0]);

        for (i = 1; i < n; i++) {
                print_char(' ');
                print_number(array[i]);
        }

        print_char('\n');
}
开发者ID:dalzuga,项目名称:holbertonschool-low_level_programming,代码行数:14,代码来源:print_array.c


示例13: print_combination_1

void print_combination_1(void){
  int n;
  for ( n=0; n<10; n++ ) { /* int n must print integers 0-9 */
      if (n==9)
	{print_number(n);
	}
      else {
      	print_number(n);
      	print_char(',');
      	print_char(' ');
	}
    }
}
开发者ID:asaiapalacios,项目名称:holbertonschool-low_level_programming,代码行数:13,代码来源:1-print_combination_1.c


示例14: main

int main(void)
{
  print_number(98);
  print_char('\n');
  print_number(402);
  print_char('\n');
  print_number(1024);
  print_char('\n');
  print_number(0);
  print_char('\n');
  print_number(-98);
  print_char('\n');
  return (0);
}
开发者ID:madejean,项目名称:holbertonschool-low_level_programming,代码行数:14,代码来源:14-main.c


示例15: test_first_modulo

void test_first_modulo() {
	struct number n1 = {0, ((uint32_t)1 << 30), 0};
	struct number n2 = {0, 0, ((uint32_t)1 << 32) - 1};

	print_number(&n1);
	std::cout << std::endl;
	print_number(&n2);
	std::cout << std::endl;
	
	struct number *result = (struct number*)malloc(sizeof(struct number));
	multp(&n1, &n2, result);
	print_number(result);
	std::cout << std::endl;
}
开发者ID:laumann,项目名称:ds,代码行数:14,代码来源:dshash_test.cpp


示例16: print_array

/* print each element of an array of integers */
void print_array(int *a, int n)
{
  int i;
  
  for (i = 0; i < n - 1; i++)
    {
      print_number(a[i]);
      print_char(',');
      print_char(' ');
    }

  print_number(a[n - 1]); /* print the last element */
  print_char('\n');
}
开发者ID:electrachong,项目名称:holbertonschool-low_level_programming,代码行数:15,代码来源:2-print_array.c


示例17: print_combination_1

void print_combination_1(void){
  int n;
  for (n = 0; n < 10; n++)
    {
      if ( n == 9)
        {
          print_number(n);
          return ;
	}

      print_number(n);
      print_char(',');
      print_char(' ');
    }
}
开发者ID:tasneemfarag,项目名称:holbertonschool-low_level_programming,代码行数:15,代码来源:1-print_combination_1.c


示例18: cJSON_Print

void cJSON_Print(cJSON *c){
	switch(c->type){
		case cJSON_Number:	print_number(c);break;
		case cJSON_String:	print_string(c);break;
		case cJSON_Object:	print_object(c);break;
	}
}
开发者ID:a86852378,项目名称:cJSON,代码行数:7,代码来源:test.cpp


示例19: switch

/* Render a value to text. */
static char *print_value(srjson_doc_t *doc, srjson_t *item, int depth, int fmt)
{
    char *out = 0;
    if (!item)
        return 0;
    switch ((item->type) & 255) {
    case srjson_NULL:
        out = srjson_strdup(doc, "null");
        break;
    case srjson_False:
        out = srjson_strdup(doc, "false");
        break;
    case srjson_True:
        out = srjson_strdup(doc, "true");
        break;
    case srjson_Number:
        out = print_number(doc, item);
        break;
    case srjson_String:
        out = print_string(doc, item);
        break;
    case srjson_Array:
        out = print_array(doc, item, depth, fmt);
        break;
    case srjson_Object:
        out = print_object(doc, item, depth, fmt);
        break;
    }
    return out;
}
开发者ID:DileepNunna,项目名称:kamailio,代码行数:31,代码来源:srjson.c


示例20: print_sieves

void print_sieves(int n){
	char *notPrime= malloc(sizeof(char) * n - 1);
	int i;
	notPrime[0] = 1;
	for(i = 1; i < n - 1; i++){
		notPrime[i] = 0;
	}
	//START LOOKING
	for(i = 1; i < n - 1; i++){
		if(!notPrime[i]){
			int number = i + 1;
			int j = i + number;
			while(j < n - 1){
				notPrime[j] = 1;
				j += number;
			}
		}
		
	}
	//FINISHED LOOKING
	for(i = 0; i < n - 1; i++){
		if(!notPrime[i])
			print_number(i+1);
	}
	free(notPrime);
	printf("\n");
} 
开发者ID:lie94,项目名称:IS1500,代码行数:27,代码来源:sieves-heap.c



注:本文中的print_number函数示例由纯净天空整理自Github/MSDocs等源码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。


鲜花

握手

雷人

路过

鸡蛋
该文章已有0人参与评论

请发表评论

全部评论

专题导读
上一篇:
C++ print_object函数代码示例发布时间:2022-05-30
下一篇:
C++ print_num函数代码示例发布时间:2022-05-30
热门推荐
阅读排行榜

扫描微信二维码

查看手机版网站

随时了解更新最新资讯

139-2527-9053

在线客服(服务时间 9:00~18:00)

在线QQ客服
地址:深圳市南山区西丽大学城创智工业园
电邮:jeky_zhao#qq.com
移动电话:139-2527-9053

Powered by 互联科技 X3.4© 2001-2213 极客世界.|Sitemap