C的数据库编程

最新推荐文章于 2024-02-04 16:45:00 发布
最新推荐文章于 2024-02-04 16:45:00 发布
阅读量1.1k 收藏 1
点赞数
分类专栏： c 文章标签： c 数据库 command function struct insert
#include <io.h>
#include <bios.h>
#include <conio.h>
#include <stdio.h>
#include <stdlib.h>
#include <dos.h>
#include <bios.h>
#include <fcntl.h>
#include <mem.h>
#include <math.h>
#include <string.h>
#include <malloc.h>
#include <time.h>

 

typedef unsigned short     num_range1;
typedef unsigned short      num_range2;
typedef unsigned short      error_num;

#define TRUE 1
#define FALSE 0
#define nil 0

 

typedef struct node *stu_p;
struct node {
    num_range1 number;
    char name[11];
    char sex;
    struct date birthdate;
    num_range2 experience;
    num_range2 force;
    num_range2 smartness;
    struct node *front;
    struct node *next;
} ;


FILE *db_file; //text文件类型出错

struct node *head,
     *current,
     *last;
int count,
    tmp;

char *command_line;//user command

/*字段缓冲变量*/
num_range1 number_c;
char name_c[11];

num_range2 experience_c;
char sex_c;
num_range2 force_c;
num_range2 smartness_c;
struct date birthdate_c;


/*过程和函数*/
student_database(); //是主函数

//布尔类型翻译出错

int  check_number();
int  check_sex();
int  check_birthdate();
int  check_experience();
int  check_force();
int  check_smartness();
///

error_num check_record();
int  condition_select();
void output_title();
void output_it();
void modify_it();
void swap_it();
void delete_it();
void add_record();
void insert_it();
void save_record();
void close_database();
void output_record();
void del_record();
void find_record();
void sort_record();
void modify_record();
void read_record();
void input_record();
void insert_record();
void command_select();
void optimize();

 

int  check_number (num_range1 check_object)
{

int function;

    if ((check_object >= 1) && (check_object <= 1000))
 function = TRUE;
    else
 function = FALSE;

    return(function);
}

int  check_sex (char check_object)
{

int function;

    if (check_object=='m'||check_object=='M'||check_object=='f'||check_object=='M')
 function = TRUE;
   else
 function = FALSE;

    return(function);
}

int  check_birthdate (struct date check_object)
{

int function;

    if ((check_object.da_year >= 1000) && (check_object.da_year <= 3000))
 if (check_object.da_mon==1||check_object.da_mon==3||
 check_object.da_mon==5||check_object.da_mon==7||check_object.da_mon==8||
 check_object.da_mon==10||check_object.da_mon==12)
     if (check_object.da_day<=31&&check_object.da_day>=1)
  function = TRUE;
     else
  function = FALSE;

 else if (check_object.da_mon==4||check_object.da_mon==6||
 check_object.da_mon==9||check_object.da_mon==11)
     if (check_object.da_day<=30&&check_object.da_day>=1)
  function = TRUE;
     else
  function = FALSE;
 else if (check_object.da_mon == 2)
     if ((check_object.da_year % 4 == 0) &&
      (check_object.da_year % 100 != 0) ||
      (check_object.da_year % 400 == 0))
  if (check_object.da_day<=29&&check_object.da_day>=1)
      function = TRUE;
  else
      function = FALSE;
     else if (check_object.da_day<=28&&check_object.da_day>=1)
  function = TRUE;
     else
  function = FALSE;
 else
     function = FALSE;
    else
 function = FALSE;

    return(function);
}

int  check_experience (num_range2 check_object)
{

int function;

    if (check_object<=100&&check_object>=0)
 function = TRUE;
    else
 function = FALSE;

    return(function);
}

int  check_force (num_range2 check_object)
{

int function;

    if (check_object<=100&&check_object>=0)
 function = TRUE;
    else
 function = FALSE;

    return(function);
}

int  check_smartness (num_range2 check_object)
{

int function;

    if (check_object<=100&&check_object>=0)
 function = TRUE;
    else
 function = FALSE;

    return(function);
}

error_num check_record (num_range1 *number_c,char *sex_c,struct date *birthdate_c,
num_range2 *experience_c,num_range2 *force_c,num_range2 *smartness_c)
{

int err_p;
error_num function;

    err_p = FALSE;    /*CHECK NUMBER*/
    if ((err_p == FALSE))
 if (check_number(*number_c))
     err_p = FALSE;
 else  {
     err_p = TRUE;
     function = 1;
 }    /*CHECK SEX*/
    if ((err_p == FALSE))
 if (check_sex(*sex_c))
     err_p = FALSE;
 else  {
            err_p = TRUE;
            function = 2;
        }    /*CHECK BIRTHDATE_C*/
    if ((err_p == FALSE))
        if (check_birthdate(*birthdate_c))
            err_p = FALSE;
 else  {
            err_p = TRUE;
            function = 3;
 }    /*CHECK experience*/
    if ((err_p == FALSE))
        if (check_experience(*experience_c))
            err_p = FALSE;
        else  {
            err_p = TRUE;
     function = 4;
        }    /*CHECK force*/
    if ((err_p == FALSE))
 if (check_force(*force_c))
     err_p = FALSE;
        else  {
     err_p = TRUE;
            function = 5;
        }    /*CHECK smartness*/
    if ((err_p == FALSE))
        if (check_smartness(*smartness_c))
            err_p = FALSE;
 else  {
            err_p = TRUE;
     function = 6;
 }    /*RETURN ERR_NUMBER*/
    if (err_p == FALSE)
 function = 0;

    return(function);
}

int  condition_select (char *condition_message)
{

int condition_code;
int function;

    printf("/n");
    printf("%s/n",condition_message);
    printf("           1 record 2 No 3 name 4 sex/n");

    printf("            5 birthday 6 experience 7 force 8 smartness/n");

    printf("/n");
    printf("choise:(1~8)");
    scanf("%d",&condition_code);
    function = condition_code;

    return(function);
}

void output_title(void)
{

    printf("/n");
    printf("    record   no    name    sex  birthday     experience    force    smartness/n");


}

void output_it (struct node *c,int n)
{

    printf("%7d",n);    /*数据输出*/
    printf("%7d",c->number);
    printf("%10s",c->name);
    printf("%6c",c->sex);
    printf("%6d/%2d/%2d",c->birthdate.da_year,c->birthdate.da_mon,
     c->birthdate.da_day);
    printf("%10d",c->experience);
    printf("%10d",c->force);
    printf("%10d",c->smartness);
    printf("/n");

}

void modify_it (struct node *c,struct node *l,int n)
{

    printf("modify %d input -1 ,still/n",n);
 printf("record %d/n",n);
 printf("No:");
 scanf("%d",&number_c);
 printf("name:");
 gets(name_c);
 gets(name_c);
 printf("sex(M,F):");
 scanf("%c",&sex_c);
 printf("birthda_day(1978 16 1):");
 scanf("%d %d %d",&birthdate_c.da_year,&birthdate_c.da_day,&birthdate_c.da_mon);
 printf("experience:");
 scanf("%d",&experience_c);
 printf("force:");
 scanf("%d",&force_c);
 printf("smartness:");
 scanf("%d",&smartness_c);
 printf("/n");
    if (number_c !=  - 1)
 if (check_number(number_c))
     c->number = number_c;
 else
     printf("out record/n");
    if (strcmp(name_c,"-1") != 0)
 strcpy (c->name,name_c);
    if (sex_c != '-')
 if (check_sex(sex_c))
     c->sex = sex_c;
 else
     printf("sex error/n");
    if ((birthdate_c.da_year !=  - 1) && (birthdate_c.da_mon !=  - 1) &&
     (birthdate_c.da_day !=  - 1))
 if (check_birthdate(birthdate_c))
     c->birthdate = birthdate_c;
 else
     printf("birthday error/n");
    if (experience_c !=  - 1)
 if (check_experience(experience_c))
     c->experience = experience_c;
 else
     printf("experience error/n");
    if (force_c !=  - 1)
 if (check_force(force_c))
     c->force = force_c;
 else
     printf("force error/n");
    if (smartness_c !=  - 1)
 if (check_smartness(smartness_c))
     c->smartness = smartness_c;
 else
     printf("smartness error/n");

}

void swap_it (struct node **current,struct node **last,struct node **c_bak,struct node **l_bak)
{
/*用于排序*/

struct node *tmp_c,
     *tmp_l;
/*使C_BAK总是指向链表尾部*/

    if (((*current)->front->front == nil) && (*last == nil)) {
 /*STATUS=4*/
        /*ONLY TWO*/        *current = (*current)->front;
        head = *c_bak;
        (*current)->front = head;
        (*c_bak)->next = *current;
 (*current)->next = nil;
        *last = nil;
 *c_bak = *current;
 *l_bak = nil;
    }    /*LAST ONE*/
    else if (((*current)->front->front != nil) && (*last == nil)) {
        *current = (*current)->front;
        (*current)->front->next = *c_bak;
        (*c_bak)->front = (*current)->front;
        (*c_bak)->next = *current;
        (*current)->front = *c_bak;
        (*current)->next = nil;
        *last = (*current)->next;
 *c_bak = *current;
        *l_bak = *last;
    }    /*SECOND ONE*/
    else if (((*current)->front->front == nil) && (*last != nil)) {
        head = *current;
        *current = (*current)->front;
        head->next->front = *current;
 (*current)->next = head->next;
        head->front = nil;
 head->next = *current;
        (*current)->front = head;
 *last = (*current)->next;
    }    /*MEDIUM*/
    else  {
 tmp_c = *current;
        *current = (*current)->front;
        (*current)->front->next = tmp_c;
        tmp_c->next->front = *current;
        tmp_c->front = (*current)->front;
        (*current)->next = tmp_c->next;
        tmp_c->next = *current;
        (*current)->front = tmp_c;
    }

}

void delete_it (struct node **current,struct node  **last)
{
/*可以自动后移指针*/

struct node *tmp;

    if ((*current == head) && (*last == nil)) {    /*statue = 4*/
    /*ONLY ONE*/
        free(*current);
        head = nil;
 *current = nil;
        *last = nil;
        count = 0;
    }    /*LAST ONE*/
    else if ((*current != head) && (*last == nil)) {
        *current = (*current)->front;
 free(*current);
        (*current)->next = *last;
        count = count - 1;
    }    /*FIRST ONE*/
    else if ((*current == head) && (*last != nil)) {
        head = *last;
 free(*current);
        *current = head;
        (*current)->front = nil;
 *last = (*current)->next;
        count = count - 1;
    }
    else  {
        (*current)->front->next = (*current)->next;
        (*current)->next->front = (*current)->front;
        tmp = *current;
        *current = *last;
        *last = (*current)->next;
 free(tmp);
        tmp = nil;
        count = count - 1;
    }    /*IF*/

}

/*PROCEDURE*/
void add_record (void)
{

struct node *tmp;

    if (head == nil) {
 tmp = (stu_p) malloc (sizeof(struct node));
 head = tmp;
 head->next = nil;
 current = head;
 current->front = nil;
 last = current->next;
    }
    else  {
 tmp = (stu_p) malloc (sizeof(struct node));
        tmp->next = nil;
 current->next = tmp;
        tmp->front = current;
 current = tmp;
        last = current->next;
    }    /*数据赋值*/
    current->number = number_c;
    strcpy (current->name,name_c);
    current->sex = sex_c;
    current->birthdate = birthdate_c;
    current->experience = experience_c;
    current->force = force_c;
    current->smartness = smartness_c;
    count = count + 1;

}

void insert_it (struct node **c,int n,int *p)
{

struct node *insert;
error_num err;

    *p = 0;
 printf("record %d/n",n);
 printf("No:");
 scanf("%d",&number_c);
 printf("name:");
 gets(name_c);
 gets(name_c);
 printf("sex(M,F):");
 scanf("%c",&sex_c);
 printf("birthda_day(1978 16 1):");
 scanf("%d %d %d",&birthdate_c.da_year,&birthdate_c.da_day,&birthdate_c.da_mon);
 printf("experience:");
 scanf("%d",&experience_c);
 printf("force:");
 scanf("%d",&force_c);
 printf("smartness:");
 scanf("%d",&smartness_c);
 printf("/n");
 err = check_record(&number_c,&sex_c,&birthdate_c,&experience_c,
  &force_c,&smartness_c);
 switch (err) {
     case 0:
  add_record();
  n = n + 1;
  *p=1;
  break;
     case 1:
  printf("no wrong:1-1000/n");

  printf("try again/n");
  break;
     case 2:
  printf("sex wrong:M male F female/n");

  printf("try again/n");
  break;
     case 3:
  printf("birthday wrong:1978 1 16/n");

  printf("try again/n");
  break;
     case 4:
  printf("experience wrong:0-100/n");

  printf("try again/n");
  break;
     case 5:
  printf("force wrong:0-100/n");

  printf("try again/n");
  break;
     case 6:
  printf("smartness wrong:0-100/n");

  printf("try again/n");
  break;
 }
    if (*p == 1) {    /*NO DATA*/
        if (*c == nil) {
            add_record();
 }    /*FIRST ONE*/
 else if (*c == head) {
            insert = (stu_p) malloc (sizeof(struct node));
            insert->front = nil;
            insert->next = nil;
     head->front = insert;
            insert->next = head;
     head = insert;
            insert->number = number_c;
            strcpy (insert->name,name_c);
            insert->sex = sex_c;
            insert->birthdate = birthdate_c;
            insert->experience = experience_c;
     insert->force = force_c;
            insert->smartness = smartness_c;
            count = count + 1;
        }
        else  {
            insert = (stu_p) malloc (sizeof(struct node));
            insert->front = nil;
     insert->next = nil;
            (*c)->front->next = insert;
            insert->front = (*c)->front;
            (*c)->front = insert;
            insert->next = *c;
     insert->number = number_c;
            strcpy (insert->name,name_c);
     insert->sex = sex_c;
            insert->birthdate = birthdate_c;
            insert->experience = experience_c;
            insert->force = force_c;
            insert->smartness = smartness_c;
            count = count + 1;
 }
    }

}

void save_record (void)
{

int n;
char path[81];
struct node *c,
            *l;

    if (head == nil)
 printf("no record/n");
    else  {
 n = 0;    /*文件初始化*/
 printf("/n");
 printf("write file name ps:pb.TXT:/n");
 gets(path);
 db_file=fopen(path,"wt");    /*指针初始化*/
 c = head;
 l = head->next;
 fprintf(db_file,"%d/n",count);    /*写入最大记录数*/
 while (c != nil) {    /*数据输出*/
     fprintf(db_file,"%d",c->number);
     fprintf(db_file,"%10s",c->name);
     fprintf(db_file,"%2lc",c->sex);
     fprintf(db_file,"%5d%3d%3d",c->birthdate.da_year,
      c->birthdate.da_day,c->birthdate.da_mon);
     fprintf(db_file,"%4d",c->experience);
     fprintf(db_file,"%4d",c->force);
     fprintf(db_file,"%4d",c->smartness);
     fprintf(db_file,"/n");
            n = n + 1;
            c = l;
            l = c->next;
        }
 fclose(db_file);    /*保护代码*/
 if (n != count)
     printf("sum of record wrong/n");
 printf("have been saved/n");
    }

}

void close_database (int n)
{
/*N为内部使用,信息显示开关*/

struct node *c,
            *l;
int i;
char pan;

    if (head != nil) {
 c = head;
 l = c->next;
 pan = ' ';
 if (n == 1) {
     printf("/n");
     printf("save database?(Y/N)/n");
     scanf("%c",&pan);
     if (pan == 'Y')
                save_record();
            printf("/n");
        }
        for (i = 1; i <= count; i++)
            delete_it(&c,&l);
        head = nil;
        current = nil;
        last = nil;
        count = 0;
        if (n == 1)
     printf("database close/n");
    }

}

void output_record (void)
{

int n,
    i;
struct node *c,
            *l;

    if (head == nil)
 printf("no record/n");
    else  {
        n = 1;    /*指针初始化*/
        c = head;
        l = head->next;
        output_title();
        for (i = 1; i <= count; i++) {
            output_it(c,n);
            n = n + 1;
            c = l;
     l = c->next;
        }
    }

}

void del_record(void)
{

int condition_code;
int i,
    deleted_num;

/*   long_c,long_d  : (* UNDEFINED TYPE: longint *);

Error 4:  type expected:  ; */
        /* UNDEFINED TYPE: longint */
int long_c,long_d;
int del_num;
num_range1 del_number;
char del_name[11];
char del_sex;
struct date del_birthdate;
num_range2 del_experience;
num_range2 del_force;
num_range2 del_smartness;
struct node *c_bak,
            *l_bak;

    condition_code = condition_select("del condition:");    /*PROTECT*/
    c_bak = current;
    l_bak = last;
    switch (condition_code) {
 case 1:
     printf("/n");
     printf("record:");
     scanf("%d",&del_num);
     if ((del_num >= 1) && (del_num <= count)) {
  if (head != nil) {
                    current = nil;
      last = nil;    /*FIND NODE*/
                    for (i = 1; i <= del_num; i++) {
   if (i == 1) {
       current = head;
       last = current->next;
   }
   else  {
       current = last;
       last = current->next;
   }    /*IF*/
      }    /*FOR*/
      delete_it(&current,&last);
      printf(" record %d delete/n",del_num);
  }
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;    /*1*/
 case 2:
     printf("/n");
     printf("no:");
     scanf("%d",&del_number);
     if ((del_number >= 1) && (del_number <= 1000)) {
  if (head != nil) {
                    current = head;
                    last = current->next;
      deleted_num = 0;
                    for (i = 1; i <= count; i++) {
   if (current->number == del_number) {
                            delete_it(&current,&last);
       deleted_num = deleted_num + 1;
   }
                        else  {
       current = last;
       last = current->next;
   }    /*IF*/
      }    /*FOR*/
      if (deleted_num != 0)
   printf(" record %d delete/n",deleted_num);
      else
      printf("no record like u need/n");
  }
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;    /*2*/
 case 3:
     printf("/n");
     printf("name:");
     gets(del_name);
     if (head != nil) {
  current = head;
  last = current->next;
  deleted_num = 0;
  for (i = 1; i <= count; i++) {
      if (strcmp(current->name,del_name) == 0) {
   delete_it(&current,&last);
   deleted_num = deleted_num + 1;
      }
      else  {
   current = last;
   last = current->next;
      }    /*IF*/
  }    /*FOR*/
  if (deleted_num != 0)
      printf(" record %d delete/n",deleted_num);
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;
 case 4:
            printf("/n");
     printf("sex:");
     scanf("%c",&del_sex);
     if (head != nil) {
  current = head;
  last = current->next;
  deleted_num = 0;
                for (i = 1; i <= count; i++) {
                    if ((current->sex == del_sex)) {
                        delete_it(&current,&last);
                        deleted_num = deleted_num + 1;
                    }
      else  {
   current = last;
   last = current->next;
      }    /*IF*/
  }    /*FOR*/
  if (deleted_num != 0)
      printf(" record %d delete/n",deleted_num);
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;
 case 5:
     printf("/n");
     printf("birthday:");
     scanf("%d%d%d",&del_birthdate.da_year,&del_birthdate.da_mon,
      &del_birthdate.da_day);
     if (head != nil) {
  current = head;
  last = current->next;
  deleted_num = 0;
  long_d = del_birthdate.da_year;
  long_d = long_d * 100;
  long_d = long_d + del_birthdate.da_mon;
  long_d = long_d * 100;
  long_d = long_d + del_birthdate.da_day;
  for (i = 1; i <= count; i++) {
      long_c = current->birthdate.da_year;
      long_c = long_c * 100;
      long_c = long_c + current->birthdate.da_mon;
      long_c = long_c * 100;
      long_c = long_c + current->birthdate.da_day;
      if ((long_c == long_d)) {
   delete_it(&current,&last);
   deleted_num = deleted_num + 1;
      }
      else  {
   current = last;
   last = current->next;
      }
  }    /*FOR*/
  if (deleted_num != 0)
      printf(" record %d delete/n",deleted_num);
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;
        case 6:
            printf("/n");
     printf("experience:");
     scanf("%d",&del_experience);
     if (head != nil) {
  current = head;
  last = current->next;
  deleted_num = 0;
  for (i = 1; i <= count; i++) {
      if ((current->experience == del_experience)) {
   delete_it(&current,&last);
   deleted_num = deleted_num + 1;
                    }
      else  {
   current = last;
   last = current->next;
      }    /*IF*/
  }    /*FOR*/
  if (deleted_num != 0)
      printf(" record %d delete/n",deleted_num);
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;
 case 7:
     printf("/n");
     printf("force:");
     scanf("%d",&del_force);
            if (head != nil) {
  current = head;
                last = current->next;
  deleted_num = 0;
                for (i = 1; i <= count; i++) {
                    if ((current->force == del_force)) {
                        delete_it(&current,&last);
   deleted_num = deleted_num + 1;
      }
      else  {
                        current = last;
   last = current->next;
      }    /*IF*/
  }    /*FOR*/
  if (deleted_num != 0)
      printf(" record %d delete/n",deleted_num);
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;
 case 8:
     printf("/n");
     printf("smartness:");
     scanf("%d",&del_smartness);
            if (head != nil) {
  current = head;
                last = current->next;
  deleted_num = 0;
                for (i = 1; i <= count; i++) {
                    if ((current->smartness == del_smartness)) {
   delete_it(&current,&last);
                        deleted_num = deleted_num + 1;
      }
      else  {
                        current = last;
   last = current->next;
      }    /*IF*/
  }    /*FOR*/
  if (deleted_num != 0)
      printf(" record %d delete/n",deleted_num);
  else
      printf("no record like u need/n");
     }
     else
  printf("out record/n");
     break;
 default:
     printf("delete error/n");
     break;
    }    /*CASE*/
    if (last != nil) {
 current = c_bak;
 last = l_bak;
    }

}

void find_record (void)
{

int condition_code;
int i,
    found_num;

/*   long_c,long_f  : (* UNDEFINED TYPE: longint *);

Error 4:  type expected:  ; */
 /* UNDEFINED TYPE: longint */
int long_c,long_f;
struct node *c,
            *l;
int find_num;
num_range1 find_number;
char find_name[11];
char find_sex;
struct date find_birthdate;
num_range2 find_experience;
num_range2 find_force;
num_range2 find_smartness;

    condition_code = condition_select("find condition:");
    switch (condition_code) {
 case 1:
     printf("/n");
     printf("record:");
     scanf("%d",&find_num);
     if ((find_num >= 1) && (find_num <= count)) {
                if (head != nil) {
                    c = nil;
                    l = nil;
                    found_num = 1;    /*FIND NODE*/
      for (i = 1; i <= find_num; i++) {
                        if (i == 1) {
                            c = head;
                            l = c->next;
                        }
                        else  {
                            c = l;
                            l = c->next;
                        }    /*IF*/
                    }    /*FOR*/
                    output_title();
      output_it(c,find_num);
      printf("find %d/n",found_num);
  }
  else
      printf("no record/n");
     }
            else
  printf("out record/n");
     break;
        case 2:
            printf("/n");
     printf("no:");
     scanf("%d",&find_number);
     if (head != nil) {
                c = head;
                l = c->next;
                found_num = 0;
                output_title();
                for (i = 1; i <= count; i++) {
                    if (c->number == find_number) {
   output_it(c,i);
                        found_num = found_num + 1;
   c = l;
                        c = c->next;
      }
      else  {
                        c = l;
                        l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
     else
  printf("out record/n");
     break;
 case 3:
     printf("/n");
     printf("name:");
     gets(find_name);
     if (head != nil) {
  c = head;
  l = c->next;
                found_num = 0;
                output_title();
                for (i = 1; i <= count; i++) {
                    if (strcmp(c->name,find_name) == 0) {
   output_it(c,i);
                        found_num = found_num + 1;
   c = l;
   c = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
     else
  printf("out record/n");
     break;
 case 4:
     printf("/n");
     printf("sex:");
     scanf("%c",&find_sex);
            if (head != nil) {
                c = head;
  l = c->next;
                found_num = 0;
                output_title();
                for (i = 1; i <= count; i++) {
                    if (c->sex == find_sex) {
   output_it(c,i);
                        found_num = found_num + 1;
   c = l;
                        c = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
     else
  printf("out record/n");
     break;
 case 5:
     printf("/n");
     printf("birthday:");
     scanf("%d%d%d",&find_birthdate.da_year,&find_birthdate.da_mon,
      &find_birthdate.da_day);
     if (head != nil) {
  c = head;
  l = c->next;
  found_num = 0;
                output_title();
  long_f = find_birthdate.da_year;
                long_f = long_f * 100;
  long_f = long_f + find_birthdate.da_mon;
  long_f = long_f * 100;
  long_f = long_f + find_birthdate.da_day;
  for (i = 1; i <= count; i++) {
      long_c = c->birthdate.da_year;
                    long_c = long_c * 100;
      long_c = long_c + c->birthdate.da_mon;
                    long_c = long_c * 100;
      long_c = long_c + c->birthdate.da_day;
                    if (long_c == long_f) {
   output_it(c,i);
                        found_num = found_num + 1;
                        c = l;
   c = c->next;
      }
                    else  {
   c = l;
                        l = c->next;
                    }
                }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
     else
  printf("out record/n");
     break;
        case 6:
            printf("/n");
     printf("experience:");
     scanf("%d",&find_experience);
            if (head != nil) {
                c = head;
                l = c->next;
                found_num = 0;
  output_title();
  for (i = 1; i <= count; i++) {
                    if (c->experience == find_experience) {
                        output_it(c,i);
                        found_num = found_num + 1;
   c = l;
   l = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
     else
  printf("out record/n");
     break;
 case 7:
     printf("/n");
     printf("force:");
     scanf("%d",&find_force);
     if (head != nil) {
  c = head;
  l = c->next;
  found_num = 0;
  output_title();
  for (i = 1; i <= count; i++) {
      if (c->force == find_force) {
   output_it(c,i);
   found_num = found_num + 1;
   c = l;
   l = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
     else
  printf("out record/n");
     break;
 case 8:
     printf("/n");
     printf("smartness:");
     scanf("%d",&find_smartness);
     if (head != nil) {
  c = head;
  l = c->next;
                found_num = 0;
                output_title();
                for (i = 1; i <= count; i++) {
      if (c->smartness == find_smartness) {
   output_it(c,i);
                        found_num = found_num + 1;
   c = l;
   l = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (found_num != 0)
      printf("find %d/n",found_num);
  else
      printf("no record/n");
     }
            else
  printf("out record/n");
     break;
 default:
     printf("find error/n");
     break;
    }    /*CASE*/

}

void sort_record (void)
{

int condition_code;
int i,
    j;

int long_c,long_f;
struct node *c_bak,
     *l_bak;

    condition_code = condition_select("sort condition:");
    switch (condition_code) {
 case 1:
     printf("record over/n");
     break;
 case 2:
     if ((head != nil) && (head->next != nil)) {
  c_bak = current;
  l_bak = last;    /*沉淀法排序*/
  for (i = count - 1; i >= 1; i--) {
      current = c_bak;
      last = l_bak;
      for (j = 1; j <= i; j++) {
   if (current->number < current->front->number)
       swap_it(&current,&last,&c_bak,&l_bak);
                        current = current->front;
   last = current->next;
                    }
                }
                current = c_bak;
                last = l_bak;
     }
     printf("no over/n");
     break;
        case 3:
            if ((head != nil) && (head->next != nil)) {
                c_bak = current;
                l_bak = last;    /*沉淀法排序*/
                for (i = count - 1; i >= 1; i--) {
                    current = c_bak;
                    last = l_bak;
                    for (j = 1; j <= i; j++) {
                        if (strcmp(current->name,
    current->front->name) < 0)
                            swap_it(&current,&last,&c_bak,&l_bak);
                        current = current->front;
   last = current->next;
                    }
                }
                current = c_bak;
                last = l_bak;
            }
     printf("name over/n");
            break;
        case 4:
     if ((head != nil) && (head->next != nil)) {
                c_bak = current;
                l_bak = last;    /*沉淀法排序*/
                for (i = count - 1; i >= 1; i--) {
                    current = c_bak;
                    last = l_bak;
                    for (j = 1; j <= i; j++) {
                        if (current->sex < current->front->sex)
                            swap_it(&current,&last,&c_bak,&l_bak);
                        current = current->front;
                        last = current->next;
      }
  }
                current = c_bak;
                last = l_bak;
            }
     printf("sex over/n");
     break;
        case 5:
            if ((head != nil) && (head->next != nil)) {
                c_bak = current;
                l_bak = last;    /*沉淀法排序*/
                for (i = count - 1; i >= 1; i--) {
                    current = c_bak;
      last = l_bak;
                    for (j = 1; j <= i; j++) {    /*CURRENT*/
   long_c = current->birthdate.da_year;
                        long_c = long_c * 100;
   long_c = long_c + current->birthdate.da_mon;
                        long_c = long_c * 100;
   long_c = long_c + current->birthdate.da_day;
   /*FRONT*/                        long_f = current->front->birthdate.da_year;
                        long_f = long_f * 100;
                        long_f = long_f +
    current->front->birthdate.da_mon;
                        long_f = long_f * 100;
   long_f = long_f + current->front->birthdate.da_day;

   if (long_c < long_f)
       swap_it(&current,&last,&c_bak,&l_bak);
   current = current->front;
   last = current->next;
      }
  }
  current = c_bak;
  last = l_bak;
     }
     printf("birthday over/n");
     break;
        case 6:
            if ((head != nil) && (head->next != nil)) {
  c_bak = current;
                l_bak = last;    /*沉淀法排序*/
                for (i = count - 1; i >= 1; i--) {
                    current = c_bak;
                    last = l_bak;
                    for (j = 1; j <= i; j++) {
                        if (current->experience < current->front->experience)
                            swap_it(&current,&last,&c_bak,&l_bak);
                        current = current->front;
   last = current->next;
                    }
  }
                current = c_bak;
                last = l_bak;
            }
     printf("experience over/n");
     break;
        case 7:
            if ((head != nil) && (head->next != nil)) {
                c_bak = current;
  l_bak = last;    /*沉淀法排序*/
  for (i = count - 1; i >= 1; i--) {
                    current = c_bak;
                    last = l_bak;
                    for (j = 1; j <= i; j++) {
                        if (current->force < current->front->force)
                            swap_it(&current,&last,&c_bak,&l_bak);
                        current = current->front;
                        last = current->next;
                    }
                }
  current = c_bak;
                last = l_bak;
     }
     printf("force over/n");
     break;
        case 8:
            if ((head != nil) && (head->next != nil)) {
                c_bak = current;
                l_bak = last;    /*沉淀法排序*/
  for (i = count - 1; i >= 1; i--) {
                    current = c_bak;
                    last = l_bak;
                    for (j = 1; j <= i; j++) {
                        if (current->smartness < current->front->smartness)
       swap_it(&current,&last,&c_bak,&l_bak);
                        current = current->front;
                        last = current->next;
                    }
                }
                current = c_bak;
  last = l_bak;
            }
     printf("smartness over/n");
     break;
    }    /*CASE*/

}

/*BEGIN*/
void modify_record (void)
{

int condition_code;
int i,
    modified_num;


int long_c,long_m;
struct node *c,
     *l;
int mdf_num;
num_range1 mdf_number;
char mdf_name[11];
char mdf_sex;
struct date mdf_birthdate;
num_range2 mdf_experience;
num_range2 mdf_force;
num_range2 mdf_smartness;

    condition_code = condition_select("modify:");
    switch (condition_code) {
 case 1:
     printf("/n");
     printf("record:");
     scanf("%d",&mdf_num);
            if ((mdf_num >= 1) && (mdf_num <= count)) {
  if (head != nil) {
                    c = nil;
                    l = nil;    /*FIND NODE*/
                    for (i = 1; i <= mdf_num; i++) {
   if (i == 1) {
                            c = head;
                            l = c->next;
   }
                        else  {
                            c = l;
       l = c->next;
   }    /*IF*/
                    }    /*FOR*/
                    modify_it(c,l,i);
      printf("%d modify/n",mdf_num);
  }
  else
      printf("no record/n");
     }
            else
      printf("out record/n");
     break;
 case 2:
     printf("/n");
     printf("no:");
     scanf("%d",&mdf_number);
            if (head != nil) {
  c = head;
  l = c->next;
  modified_num = 0;
  for (i = 1; i <= count; i++) {
      if (c->number == mdf_number) {
   modify_it(c,l,i);
   modified_num = modified_num + 1;
   c = l;
   c = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 case 3:
     printf("/n");
     printf("name:");
     gets(mdf_name);
     if (head != nil) {
  c = head;
  l = c->next;
  modified_num = 0;
  for (i = 1; i <= count; i++) {
                    if (strcmp(c->name,mdf_name) == 0) {
                        modify_it(c,l,i);
   modified_num = modified_num + 1;
                        c = l;
   c = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 case 4:
     printf("/n");
     printf("sex:");
     scanf("%c",&mdf_sex);
     if (head != nil) {
  c = head;
  l = c->next;
  modified_num = 0;
  for (i = 1; i <= count; i++) {
      if (c->sex == mdf_sex) {
   modify_it(c,l,i);
   modified_num = modified_num + 1;
                        c = l;
   c = c->next;
                    }
                    else  {
                        c = l;
                        l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 case 5:
     printf("/n");
     printf("birthday:");
     scanf("%d%d%d",&mdf_birthdate.da_year,&mdf_birthdate.da_mon,
      &mdf_birthdate.da_day);
     if (head != nil) {
  c = head;
                l = c->next;
                modified_num = 0;
  long_m = mdf_birthdate.da_year;
                long_m = long_m * 100;
  long_m = long_m + mdf_birthdate.da_mon;
                long_m = long_m * 100;
  long_m = long_m + mdf_birthdate.da_day;
  for (i = 1; i <= count; i++) {
      long_c = c->birthdate.da_year;
                    long_c = long_c * 100;
      long_c = long_c + c->birthdate.da_mon;
      long_c = long_c * 100;
      long_c = long_c + c->birthdate.da_day;
      if ((long_c == long_m)) {
                        modify_it(c,l,i);
   modified_num = modified_num + 1;
                        c = l;
                        c = c->next;
                    }
                    else  {
                        c = l;
                        l = c->next;
                    }
  }    /*FOR*/
                if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 case 6:
     printf("/n");
     printf("experience:");
     scanf("%d",&mdf_experience);
            if (head != nil) {
                c = head;
                l = c->next;
                modified_num = 0;
                for (i = 1; i <= count; i++) {
                    if (c->experience == mdf_experience) {
   modify_it(c,l,i);
   modified_num = modified_num + 1;
   c = l;
   c = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 case 7:
     printf("/n");
     printf("force:");
     scanf("%d",&mdf_force);
     if (head != nil) {
  c = head;
  l = c->next;
  modified_num = 0;
  for (i = 1; i <= count; i++) {
      if (c->force == mdf_force) {
   modify_it(c,l,i);
   modified_num = modified_num + 1;
   c = l;
   c = c->next;
      }
      else  {
   c = l;
   l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 case 8:
     printf("/n");
     printf("smartness:");
     scanf("%d",&mdf_smartness);
            if (head != nil) {
  c = head;
                l = c->next;
  modified_num = 0;
                for (i = 1; i <= count; i++) {
                    if (c->smartness == mdf_smartness) {
                        modify_it(c,l,i);
                        modified_num = modified_num + 1;
                        c = l;
   c = c->next;
                    }
                    else  {
                        c = l;
                        l = c->next;
      }    /*IF*/
  }    /*FOR*/
  if (modified_num != 0)
      printf(" %d modify/n",modified_num);
  else
      printf("no record/n");
     }
     else
      printf("no record/n");
     break;
 default:
     printf("modify error/n");
     break;
    }    /*CASE*/

}

void read_record (void)
{

int n,i,len;
char *path;
char panduan;

    count = 0;    /*文件初始化*/
    printf("/n");
    printf("give the name of dbf like pb.txt:/n");
    gets(path);
    if((db_file=fopen(path,"rt"))==NULL)
 printf("this file is not exist");
    else
    {
    fseek(db_file,0,SEEK_SET);
    fscanf(db_file,"%d",&n);    /*读取最大记录数*/
    for (i = 1; i <=n; i++) {    /*数据载入缓冲*/
 fscanf(db_file,"%d",&number_c);
 fscanf(db_file,"%10s",&name_c);
 fseek(db_file,1,SEEK_CUR);
 fscanf(db_file,"%c",&sex_c);
 fscanf(db_file,"%5d",&birthdate_c.da_year);
 fscanf(db_file,"%3d",&birthdate_c.da_day);
 fscanf(db_file,"%3d",&birthdate_c.da_mon);
 fscanf(db_file,"%4d",&experience_c);
 fscanf(db_file,"%4d",&force_c);
 fscanf(db_file,"%4d",&smartness_c);
 add_record();
    }
    printf("file read end/n");
    printf("record number is %d /n",i-1);
    }

}

void input_record (void)
{

int n,err;

    n = count + 1;
    printf("/n");
    printf("after enter/n");
    number_c=0;
    while ( number_c!=-1 ) {
 printf("record %d/n",n);
 printf("No:");
 scanf("%d",&number_c);
 printf("name:");
 gets(name_c);
 gets(name_c);
 printf("sex(M,F):");
 scanf("%c",&sex_c);
 printf("birthda_day(1978 16 1):");
 scanf("%d %d %d",&birthdate_c.da_year,&birthdate_c.da_day,&birthdate_c.da_mon);
 printf("experience:");
 scanf("%d",&experience_c);
 printf("force:");
 scanf("%d",&force_c);
 printf("smartness:");
 scanf("%d",&smartness_c);
 printf("/n");
 err = check_record(&number_c,&sex_c,&birthdate_c,&experience_c,
  &force_c,&smartness_c);
 switch (err) {
     case 0:
  add_record();
  n = n + 1;
  break;
     case 1:
  printf("no wrong:1-1000/n");

  printf("try again/n");
  break;
     case 2:
  printf("sex wrong:M male F female/n");

  printf("try again/n");
  break;
     case 3:
  printf("birthday wrong:1978 1 16/n");

  printf("try again/n");
  break;
     case 4:
  printf("experience wrong:0-100/n");

  printf("try again/n");
  break;
     case 5:
  printf("force wrong:0-100/n");

  printf("try again/n");
  break;
     case 6:
  printf("smartness wrong:0-100/n");

  printf("try again/n");
  break;
 }
 printf("enter to continue,-1 to end");
 printf("/n");
    }

}

void insert_record (void)
{

int i,
    n,
    p;
struct node *c,
     *l;

    if (head != nil) {
        printf("/n");
 printf("insert record:");
 scanf("%d",&n);
 if ((n >= 1) && (n <= count)) {
     c = nil;
            l = nil;
            for (i = 1; i <= n; i++) {
                if (i == 1) {
                    c = head;
                    l = c->next;
                }
                else  {
                    c = l;
                    l = c->next;
                }
            }
     insert_it(&c,n,&p);
     if (p == 1)
  printf("insert over/n");
     else
  printf("insert wrong/n");
 }
 else
     printf("out record/n");
    }
    else  {
 insert_it(&head,1,&p);
     if (p == 1)
  printf("insert over/n");
     else
  printf("insert wrong/n");
    }

}

void command_select (char command_line[])
{

    if ((strcmp(command_line,"APPEND") == 0) || (strcmp(command_line,
            "ADD") == 0)) {
 strcpy (command_line,"");//clear command_line
 input_record();//input
    }
    else if ((strcmp(command_line,"DEL") == 0) || (strcmp(command_line,
     "DELETE") == 0)) {
 strcpy (command_line,"");
 del_record();//delete
    }
    else if (strcmp(command_line,"SAVE") == 0) {
 strcpy (command_line,"");
 save_record();//save
    }
    else if (strcmp(command_line,"LOAD") == 0) {
 strcpy (command_line,"");
 read_record();//load
    }
    else if (strcmp(command_line,"INSERT") == 0) {
 strcpy (command_line,"");
 insert_record();//insert
    }
    else if ((strcmp(command_line,"SHOW") == 0) || (strcmp(command_line,
     "DIR") == 0)) {
 strcpy (command_line,"");
 output_record();//show
    }
    else if (strcmp(command_line,"FIND") == 0) {
 strcpy (command_line,"");
 find_record();//find
    }
    else if (strcmp(command_line,"SORT") == 0) {
 strcpy (command_line,"");
 sort_record();//sort
    }
    else if (strcmp(command_line,"MODIFY") == 0) {
 strcpy (command_line,"");
 modify_record();//modify
    }
    else if (strcmp(command_line,"HELP") == 0) {
 strcpy (command_line,"");


 printf("command help:");
 printf("APPEND,");
 printf("DELETE,");
 printf("SAVE,");
 printf("LOAD,");
 printf("INSERT,");
 printf("SHOW,");
 printf("FIND,");
 printf("SORT,");
 printf("CLOSE,");
 printf("MODIFY,");
 printf("QUIT,");
 printf("HELP");
    }
    else if (strcmp(command_line,"CLOSE") == 0) {
 strcpy (command_line,"");
        close_database(1);
    }
    else if ((strcmp(command_line,"QUIT") == 0) || (strcmp(command_line,
     "EXIT") == 0))
 strcpy (command_line,"QUIT");//exit
    else  {
 strcpy (command_line,"");
 printf("wrong command/n");//wrong
    }
}

void optimize(char command[])
{

char ch;
int i;

    ch = command[0];
    i = 1;
    while (ch != 0) {
 if ((ch > 96) && (ch < 123))
     command[i - 1] = ch - 32;
 i = i + 1;
 ch = command[i - 1];
    }

}


void main()
{
    head = nil;    /*变量初始化*/
    current = nil;
    last = nil;
    count = 0;
    tmp = 0;
    strcpy (command_line,"");
    while (strcmp(command_line,"QUIT") != 0) {//press quit to end
 printf("/n");
 printf("PB.COMMAND>");
 gets(command_line);//get command
 optimize(command_line);//up key
 command_select(command_line);//select command
 /*if current<>nil then writeln('test:  ',current^.name);*/    }

}

 
halfstudio
关注
  • 0
    点赞
  • 踩
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
C语言嵌入式数据库编程
05-27
C语言数据库编程，嵌入式编程、幻灯片教学。
C语言数据库编程
weixin_34195364的博客
09-18 195
----摘自个人C语言数据库项目报告 3.4逻辑结构的SQL语句实现 创建基本表： 3.4-1建立商品表： create table goods(goods_id int primary key,goods_types varchar,goods_name varchar,goods_price varchar,appraise text); 3.4-2建立卖家表： create ta...
c语言数据库编程技术,C语言数据库编程
weixin_31659249的博客
05-21 316
----摘自个人C语言数据库项目报告3.4逻辑结构的SQL语句实现创建基本表：3.4-1建立商品表：create table goods(goods_id int primary key,goods_types varchar,goods_name varchar,goods_price varchar,appraise text);3.4-2建立卖家表：create table seller(s...
【C/C++学院】（23）Mysql数据库编程--C语言编程实现mysql客户端
weixin_34289454的博客
06-29 192
【送给在路上的程序员】 对于一个开发者而言，能够胜任系统中任意一个模块的开发是其核心价值的体现。 对于一个架构师而言，掌握各种语言的优势并可以利运用到系统中，由此简化系统的开发，是其架构生涯的第一步。 对于一个开发团队而言，能够在短期内开发出用户满意的软件系统是其核心竞争力的体现。 每一个程序员都不能固步自封，要多接触新的行业...
C语言写数据库
渣渣馬的博客
08-05 2417
代码】C语言写数据库。fread函数、fwrite函数、fflush函数、C语言的错误机制、atoi函数、结构体嵌套等。
c语言sybase数据库编程.pdf
09-30
c语言sybase数据库编程.pdf
Python数据库编程 SQLite MySQL
05-14
SQLite 定义 SQLite是嵌入式关系... 使用 ANSI-C 编写的，并提供了简单和易于使用的 API 可在 UNIX（Linux, Mac OS-X, Android, iOS）和 Windows（Win32, WinCE, WinRT）中运行 SQLite是python自带的数据库，
SQLite数据库C语言编程的demo示例
最新发布
07-18
内容概要：这是一个通过显式调用（dlopen）方式，使用SQLite库API函数C语言编程的demo示例。里面包含了SQLite数据库文件的创建、数据库表创建、插入、修改、删除、查询等功能操作。该资源包中的程序有在Ubuntu环境下...
C数据库编程实用PPT课件.pptx
10-06
【C数据库编程】\n\n在C编程中，数据库编程主要涉及如何利用各种技术与数据库进行交互，管理和处理数据。本课件主要介绍了数据库的基本概念、SQL语言、ODBC、ADO以及OLE DB，并以MFC ODBC向导过程为例，阐述了在...
12.rar_数据库编程_C/C++_
08-11
标题 "12.rar_数据库编程_C/C++_" 暗示了这个压缩包包含与使用C或C++语言进行数据库编程相关的资源。描述 "WinAPI Database on C" 提供了更具体的信息，说明这些资源可能专注于如何在Windows操作系统环境下利用...
Linux下C语言结合数据库编程
08-25
本人倾心打造esql编程pdf格式完美文档。涵盖了C语言结合各种数据库进行嵌入式开发实例。数据库包括：DB2、Informix、Sysbase、mirosoft SqlServer。
c语言实现简单数据库
04-30
哈工大 软件设计2 c++实现简单数据库 功能：select、 insert（插入后排序）、create、delete等 比较全面
C#数据库编程实战经典.pdf
05-15
最新 最全 免费 高清C#数据库编程实战经典.pdf
基于C语言的数据库的简单实现
01-15
用C语言去实现简单数据库的一些操作。增删改查；
C 语言中如何进行数据库编程？C 语言中如何进行图形界面编程？
fengyege的博客
07-21 845
数据库编程是指使用编程语言与数据库进行交互的过程。它包括连接数据库、执行查询和更新操作、处理返回结果等步骤。在C语言中进行数据库编程，需要使用数据库接口库来实现与数据库的交互。常见的数据库接口库有MySQL的Connector/C、PostgreSQL的libpq、SQLite的SQLite3等。以下是C语言中使用MySQL数据库接口库进行数据库编程的基本步骤：建立数据库连接：首先调用函数初始化一个MYSQL结构体，并使用函数连接到数据库服务器。exit(1);执行SQL查询语句：使用。
1. C语言实现一个数据库
sinat_41853451的博客
09-26 1745
实现REPL。
C语言常见面试题：C语言中如何进行数据库编程？
dxl920807的博客
02-04 374
在C语言中进行数据库编程通常涉及到使用特定的数据库API。
3. C语言实现一个数据库
sinat_41853451的博客
09-26 2487
保存数据在内存中。
c语言能开发数据库程序,C语言数据库应用程序开发.ppt
weixin_42121272的博客
05-20 276
C语言数据库应用程序开发C语言数据库应用程序开发 本章内容 9.1 嵌入式SQL语句 嵌入式SQL语言的一些概念 1．嵌入式SQL语句 嵌入式SQL语句是指在应用程序中嵌入SQL语句。该应用程序称为宿主程序或主程序，书写该程序的语言称为宿主语言或主语言。 2．执行性SQL语句和说明性SQL语句 嵌入的SQL语句主要有两种类型：执行性SQL语...
c语言连接数据库错误,菜鸟,c语言数据库编程有关问题
05-30
您好，很高兴能为您解答问题。 连接数据库时，通常需要使用数据库API来实现。对于C语言而言，常用的数据库API有ODBC、JDBC、MySQL、SQLite等。其中，MySQL和SQLite是开源的数据库，也比较容易上手。 在使用这些API连接数据库时，需要注意以下几点： 1. 确认数据库的连接信息，包括数据库地址、端口号、用户名、密码等。 2. 确认使用的数据库API的正确性和版本号。 3. 在连接数据库之前，需要先初始化API，例如ODBC需要调用SQLAllocHandle函数来初始化API。 4. 在连接数据库时，需要使用API提供的函数来建立连接，例如MySQL可以使用mysql_init和mysql_real_connect函数来连接数据库。 5. 连接成功后，可以使用API提供的函数来执行SQL语句，例如MySQL可以使用mysql_query函数来执行SQL查询语句。 6. 在使用完毕后，需要释放API的资源，例如ODBC需要调用SQLFreeHandle函数来释放资源。 以上是C语言连接数据库的一些基本知识和注意事项，希望能对您有所帮助。如果您有具体的问题或需要更详细的解答，请随时提出。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值