Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 734967
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 14, 20262026-05-14T07:26:05+00:00 2026-05-14T07:26:05+00:00

I am developing a database-like application that stores a a structure containing: struct Dictionary

  • 0

I am developing a database-like application that stores a a structure containing:

struct Dictionary
{
    char *key;
    char *value;

    struct Dictionary *next;
};

As you can see, I am using a linked list to store information. But the problem begins when the user exits out of the program. I want the information to be stored somewhere. So I was thinking of storing the linked list in a permanent or temporary file using fopen, then, when the user starts the program, retrieve the linked list. Here is the method that prints the linked list to the console:

void PrintList()
{
    int count = 0;
    struct Dictionary *current;

    current = head;

    if (current == NULL)
    {
            printf("\nThe list is empty!");
        return;
    }

    printf("    Key \t  Value\n");
    printf("  ======== \t ========\n");

    while (current != NULL)
    {
        count++;
        printf("%d.  %s \t %s\n", count, current->key, current->value);
        current = current->next;
    }
}

So I am thinking of modifying this method to print the information through fprintf instead of printf and then the program would just get the infomation from the file. Could someone help me on how I can read and write to this file? What kind of file should it be, temporary or regular? How should I format the file (like I was thinking of just having the key first, then the value, then a newline character)?

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-14T07:26:05+00:00Added an answer on May 14, 2026 at 7:26 am

    The file should probably be regular. A temp file isn’t guaranteed to be there the next time your start your application. Also, your format there looks fine for humans, not so fine for machines. I’d recommend either creating your own binary file format or using XML(or maybe JSON?). You could probably format it pretty easily like

    key1\0value1\0key2\0value2\0....
    

    I’ll write a quick example is psuedoish code:

    //To write...
    Dictionary *this=begin_list;
    while(this!=null){
      for(i=0;i<strlen(this->key);i++){
        write_byte(this->key[i]);
      }
      for(i=0;i<strlen(this->value);i++){
        write_byte(this->value[i]);
      }
      this=this->next;
    }
    
    //to read...
    Dictionary *prev;
    Dictionary *this;
    char *buffer;
    while(!eof){
      buffer=malloc(MAX_STRING_LEN);
      int i=0;
      this=malloc(sizeof(Dictionary)
      while(i<MAX_STRING_LEN){ //note no error checking
        buffer[i]=read_byte();
        if(buffer[i]==0){
          break;
        }
      }
      this->key=buffer;
      buffer=malloc(MAX_STRING_LEN)
      while(i<MAX_STRING_LEN){ //note no error checking
        buffer[i]=read_byte();
        if(buffer[i]==0){
          break; 
        }
      }
      this->value=buffer;
      if(prev!=null){
        prev->next=this;
      }
      this->next=null;
      prev=this;
    }
    

    I know it’s a poor example. I think scanf or similar may make the job a ton easier, but my C skills are getting rusty.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am developing a CMS that stores user content in a database table like
I am currently developing an application that makes use of an SQL database. In
I am developing an application that needs to store information to a database. I
I'm developing a web application that involves the use of timestamps. I would like
I'm developing an web application that uses a non-relational database as a backend (django-nonrel
I'm currently developing an application that needs to store data in it's on database,
I am currently developing an application that processes several files, containing around 75,000 records
I'm developing a application that needs storing secrets in a database. I need a
I am developing a custom server application that will access a database. I need
I'm developing a web application that will use a google spreadsheet as a database.

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.