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 7956665
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 4, 20262026-06-04T04:03:35+00:00 2026-06-04T04:03:35+00:00

I have this struct typedef struct { int numberPipes; // | int numberAmpersands; //

  • 0

I have this struct

typedef struct
{
    int numberPipes;              // |
    int numberAmpersands;         // &
    int existsBiggerThan;         // >
    int existsLessThan;           // <
    int existsDoubleLargerThan;   // >>

} lineData;

and I run in my loop on a char array (char*), in order to find all indexes of '&' and '|' .

I don’t know how much '&' and '|' I’m going to find . Is it possible to start with two arrays (using malloc)
of size 1 and enlarge them after each iteration , only if I find another occurrence of one of them ?

  • 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-06-04T04:03:37+00:00Added an answer on June 4, 2026 at 4:03 am

    You can do that by calling realloc.

    For performance reasons, it might be better to call it not for each new element, but once in X elements, so you reduce the number of calls to malloc / realloc.

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

Sidebar

Related Questions

I have this struct typedef struct grade { char firstName[SIZE]; char lastName[SIZE]; int stuNum;
Let's say I have a first structure like this: typedef struct { int ivalue;
I have a struct like this typedef struct bookStruct { char title[80]; char author[80];
I have this code struct Student { char name[48]; float grade; int marks[10,5]; char
I have a interface documented like this: typedef struct Tree { int a; void*
I have this struct: #define sbuffer 128 #define xbuffer 1024 typedef struct{ char name[sbuffer];
I have a struct like this: typedef struct { int sizes[3]; float **vals[3]; //
I have this structure: typedef struct { int data[10]; } small_structure; and this code:
I have this complicated structure thingie: #include <stdlib.h> typedef struct { int x; int
I have a header file including a structure like this: typedef struct { int

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.