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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 16, 20262026-05-16T12:10:19+00:00 2026-05-16T12:10:19+00:00

Say we have typedef struct { int value1; int value2; } values_t; and values_t*

  • 0

Say we have

typedef struct {
  int value1;
  int value2;
} values_t;

and

values_t* values;

is filled with values[i].value1 and values[i].value2 pairs that may or may not be unique.

and we want to fill

values_t* values_unique;

only with unique pairs from values, in the order they first appear in values.

What is the ideal way to do this in C?

EDIT: Assume they are properly malloced pointers; above is just pseudo code.

  • 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-16T12:10:20+00:00Added an answer on May 16, 2026 at 12:10 pm

    You probably use a hash of the values, maintaining a list of the hashes and the corresponding values, and only add a new pair to the values_unique array (which the question does originally did not declare as an array) if it is not found via the hash. If the list is large, the speed up from hashing instead of searching through the entire list sequentially can be quite significant.

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

Sidebar

Related Questions

Let's say I have a first structure like this: typedef struct { int ivalue;
Say I have a struct like the following ... typedef struct { int WheelCount;
Let's say I have some typedef struct {int b;} some_t; and a pointer a
Let say I have these: typedef id Title; typedef struct{ Title title; int pages;
Let's say I have two maps: typedef int Id; std::map<Id, std::string> idToStringMap; std::map<Id, double>
Say I have the following c code: typedef struct _test test; struct _test {
Say we have, typedef struct{ char* ename; char** pname; }Ext; Ext ext[5]; What I
Lets say, I have the following text file: Listing 1: Endianess=little AddressModel=32 typedef struct{
is it possible to do say int filename = 0; typedef struct{ char name;
Let's say I have this struct in ANSI C: typedef struct _point { float

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.