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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 6, 20262026-06-06T07:06:27+00:00 2026-06-06T07:06:27+00:00

I have this type which is basically a struct { int x,y,z; } that

  • 0

I have this type which is basically a

struct { int x,y,z; } 

that I want to use as a key for a stl map. Since it’s a custom type, I need to implement the operator< for the map to do it’s compare magic.

I’m having a hard time coming with the function that will allow that. So far, I’ve tried :

return X < v.X && Y < v.Y && Z < v.Z;

which is not working at all, and

return X*X+Y*Y+Z*Z < v.X*v.X+v.Y*v.Y+v.Z*v.Z;

which gives this shape instead of a square:

enter image description here

Keep in mind, the x,y or z value could be negative, which further invalidates the later solution.

Anyone have any idea how to implement such feature?

  • 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-06T07:06:28+00:00Added an answer on June 6, 2026 at 7:06 am

    I assume you just want any stable order so an ordered container will work.

    if ( X != v.X ) return X < v.X;
    if ( Y != v.Y ) return Y < v.Y;
    return Z < v.Z; 
    

    What this does: you order based on X unless the X’s are equal, if so you order on Y, etc.

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

Sidebar

Related Questions

Look at this complex type, which is basically a DTO that wraps some entities.
I have this mysql table called comments which looks like this: commentID parentID type
I have this code here, which is intended to allow any type of arguments:
Lets say have this immutable record type: public class Record { public Record(int x,
I have two C functions, which basically operate on a stack data structure. This
I have this code, which basically looks up an IP address when a user
Basically, I've defined and typedef'ed this struct: typedef struct{ void** elements; int numElements; int
So I have this huge tree that is basically a big switch/case with string
I basically have a Money value type, which consists of Amount and Currency .
I currently have a Content Type called News which is very simple (No custom

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.