初一就学会了五种编程语言算不算超越同龄人呢？ 第1页

       https://1eq.ca/wp-content/uploads/2021/02/wxrec_done_64bit_linux.zip     

       // CB_WENXUE.c // // A SIMPLE CIRCULAR BUFFER EXAMPLE //  //   LICENSE :  WTFPL // #include <stdio.h> #include <pthread.h> #include <unistd.h> //sleep() is from here #include <malloc.h> #include <sched.h> #include <string.h> #include <stdbool.h> #include <stdint.h> #define DATACAP 16    typedef struct cbuff{ float rt_arr[DATACAP]; int dhead_p; //实际上是 GLOBAL 全局计数器 int dtail_p;     int dqlen; }*RQB;  struct cbuff *init_cb(void){ struct cbuff  *cbStru_ptr = NULL; cbStru_ptr = (struct cbuff *)malloc(sizeof(struct cbuff)); if(cbStru_ptr == NULL) { puts("init_cb: Mem alloc error!
");  return NULL;} cbStru_ptr->dhead_p = 0;  cbStru_ptr->dtail_p = 0;     cbStru_ptr->dqlen = 0; return cbStru_ptr;     }  // KEEP IT SIMPLE int isfull_cb(struct cbuff *cbStru_ptr){      return (cbStru_ptr->dqlen == DATACAP) & (cbStru_ptr->dhead_p == cbStru_ptr->dtail_p );      } int isempt_cb(struct cbuff *cbStru_ptr){     return  (cbStru_ptr->dqlen != DATACAP) & (cbStru_ptr->dhead_p == cbStru_ptr->dtail_p) ; } int isXrun_cb(struct cbuff *cbStru_ptr){      return (cbStru_ptr->dqlen !=0) & (cbStru_ptr->dhead_p == cbStru_ptr->dtail_p ); } // Delete one element from Data Queue int poll_cb(struct cbuff *cbStru_ptr)  { if( isempt_cb(cbStru_ptr) ) { puts("poll_cb: buffer queue is empty"); return -1;}       else {         cbStru_ptr->rt_arr[ (cbStru_ptr->dhead_p + 1) % DATACAP ] ;         cbStru_ptr->dqlen = cbStru_ptr->dqlen -1 ;     }         return  0 ; }  int put_cb(struct cbuff *cbStru_ptr, float rt_data)       { if( isfull_cb(cbStru_ptr) ) {         puts("put_cb: buffer queue is full. Overwriting data.
");           cbStru_ptr->rt_arr[ cbStru_ptr->dtail_p % DATACAP ] = rt_data;         printf (" put_cb:data %f , stored to pos--> %d 
", rt_data, (cbStru_ptr->dtail_p) );         cbStru_ptr->dtail_p = (cbStru_ptr->dhead_p +1) % DATACAP ;           cbStru_ptr->dhead_p = (cbStru_ptr->dhead_p +1) % DATACAP ;           cbStru_ptr->dqlen = DATACAP ;         printf ("put_cb:data queue Head ----------------->>> %d
", cbStru_ptr->dhead_p );         printf ("put_cb:data queue Tail ------------------->>> %d
", cbStru_ptr->dtail_p );         printf ("put_cb:data queue Length-------->>> %d
", cbStru_ptr->dqlen );         return -10089; }       else {         cbStru_ptr->rt_arr[ (cbStru_ptr->dtail_p) % DATACAP ] = rt_data;         printf ("put_cb:data %f , stored to pos--> %d 
", rt_data, (cbStru_ptr->dtail_p) );           cbStru_ptr->dtail_p = (cbStru_ptr->dtail_p +1) % DATACAP ;               //cbStru_ptr->dqlen = cbStru_ptr->dqlen +1 ;         cbStru_ptr->dqlen = cbStru_ptr->dqlen +1 ;         printf ("put_cb:data queue Head -------------------> %d
", cbStru_ptr->dhead_p );         printf ("put_cb:data queue Tail ---------------------> %d
", cbStru_ptr->dtail_p );         printf ("put_cb:data queue Length----------> %d
", cbStru_ptr->dqlen );    return  0 ;   }     }    float get_cb(struct cbuff *cbStru_ptr, float rt_data ) { if(isempt_cb(cbStru_ptr) ) { puts("
get_cb:buffer empty :p 
"); return -10086; }     else { rt_data = cbStru_ptr->rt_arr[ cbStru_ptr->dhead_p % DATACAP ];     cbStru_ptr->dhead_p = (cbStru_ptr->dhead_p +1) % DATACAP ;     cbStru_ptr->dqlen = (cbStru_ptr->dqlen -1) % DATACAP; return rt_data;       }         }  // Clear the Data Queue   int reset_cb(struct cbuff *cbStru_ptr) { cbStru_ptr->dhead_p = 0;  cbStru_ptr->dtail_p = 0;     cbStru_ptr->dqlen =0;     printf( "
reset_cb: Address of Array:%p, 	 Array pointer Size:%d 

", cbStru_ptr, sizeof(cbStru_ptr->rt_arr)); return 0; } int gc_cb(struct cbuff *cbStru_ptr) { if(cbStru_ptr == NULL) {  puts("gc_cb: pointer null
");   return -1; } free(cbStru_ptr); return 0; }  ///////////////////////////////////////////////////////////////////////////////////  int main() {     float test_input = 0.111111, ret_float;     int ret_err; RQB my_cbuff_ptr; my_cbuff_ptr = init_cb();     reset_cb(my_cbuff_ptr) ;             printf ("
Size of CBStruct:%d 

", sizeof(struct cbuff));     //testing for(int i = 0;i< 50;i++) {         ret_err = put_cb(my_cbuff_ptr, i * test_input) ;         if(ret_err==0 )         {         printf("
Attempt %d:	 %10.5f <<<<<<<<<<ERROR: %d  <<<<<<<<<<<<<<<<<<< Data to inject
", (i+1), i * test_input , ret_err);         printf("Data queue Length: %d:
", my_cbuff_ptr->dqlen );           printf("Data injected: %f:

", my_cbuff_ptr->dhead_p );           }         else         {         printf("
Attempt %d:	 %10.5f <<<<<<<<<<ERROR: %d  <<<<<<<<<<<<<<<<<<< Data to inject
", (i+1), i * test_input, ret_err);         printf("Data queue Length: %d:
", my_cbuff_ptr->dqlen );           printf("Data injected: %f:
", my_cbuff_ptr->dhead_p );         printf (" Error: %d 

", ret_err);               }          }  sleep(1);  for(int i = 0;i<32;i++) {          ret_float = get_cb(my_cbuff_ptr, ret_float); printf("
	 get attempt %d ---> 	 %10.5f 
",  (1+i), ret_float); }       //testing 2 for(int i = 0;i< 16;i++) {         ret_err = put_cb(my_cbuff_ptr, i * test_input) ;         if(ret_err==0 )         {         printf("
Test2 try %d:	 %10.5f <<<<<<<<<<ERROR: %d  <<<<<<<<<<<<<<<<<<< Data to inject
", (i+1), i * test_input , ret_err);         printf("Data queue Length: %d:
", my_cbuff_ptr->dqlen );           printf("Data injected: %f:

", my_cbuff_ptr->dhead_p );           }         else         {         printf("
Test2 try %d:	 %10.5f <<<<<<<<<<ERROR: %d  <<<<<<<<<<<<<<<<<<< Data to inject
", (i+1), i * test_input, ret_err);         printf("Data queue Length: %d:
", my_cbuff_ptr->dqlen );           printf("Data injected: %f:
", my_cbuff_ptr->dhead_p );         printf (" Error: %d 

", ret_err);               }         }      sleep(1);  for(int i = 0;i<16;i++) {         ret_float = get_cb(my_cbuff_ptr, ret_float); printf("
	 get attempt %d ---> 	 %10.5f 
",  (1+i), ret_float); }  gc_cb(my_cbuff_ptr); return 0; }