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

  • Home
  • SEARCH
  • 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 112805
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T02:36:09+00:00 2026-05-11T02:36:09+00:00

I have a list of non-overlaping ranges (ranges of numbers, e.g. 500-1000, 1001-1200 ..

  • 0

I have a list of non-overlaping ranges (ranges of numbers, e.g. 500-1000, 1001-1200 .. etc), is there an elegant and fast way to do lookup by only passing a number? I could use List.BinarySearch() or Array.BinarySearch() but I have to pass the type of the range object (Array.BinarySearch(T[], T)), I can pass a dummy range object and get the job done (only do the comparison with the range start) but I was wondering if this can be done in a cleaner way by only passing an integer and getting the range object, is there a way to achieve this?

  • 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. 2026-05-11T02:36:10+00:00Added an answer on May 11, 2026 at 2:36 am

    Three options:

    • Create a dummy Range and suck it up. Urgh.
    • Hand-craft a binary search just for this case. Not too bad.
    • Generalise the binary search for any IList and a TValue, given an IRangeComparer. I’m not wild on the name ‘TRange’ here – we’re not necessarily talking about ranges, but just finding the right place based on a comparison between two different types.

    The third option would go something like:

    public interface IRangeComparer<TRange, TValue> {     /// <summary>     /// Returns 0 if value is in the specified range;     /// less than 0 if value is above the range;     /// greater than 0 if value is below the range.     /// </summary>     int Compare(TRange range, TValue value); }   /// <summary> /// See contract for Array.BinarySearch /// </summary> public static int BinarySearch<TRange, TValue>(IList<TRange> ranges,                                                TValue value,                                                IRangeComparer<TRange, TValue> comparer) {     int min = 0;     int max = ranges.Count-1;      while (min <= max)     {         int mid = (min + max) / 2;         int comparison = comparer.Compare(ranges[mid], value);         if (comparison == 0)         {             return mid;         }         if (comparison < 0)         {             min = mid+1;         }         else if (comparison > 0)         {             max = mid-1;         }     }     return ~min; } 

    Apologies if I’ve got any off-by-one errors. I haven’t tested it at all, but it does at least compile 🙂

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

Sidebar

Ask A Question

Stats

  • Questions 52k
  • Answers 52k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • added an answer use shadowbox!!! May 11, 2026 at 6:45 am
  • added an answer If you use MemberwiseClone() you will get a shallow copy… May 11, 2026 at 6:45 am
  • added an answer Try: find . -name '*.undo' -ls | awk '{total +=… May 11, 2026 at 6:45 am

Top Members

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

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.