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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 20, 20262026-05-20T20:43:34+00:00 2026-05-20T20:43:34+00:00

In addition to this question Find number range intersection I want to get the

  • 0

In addition to this question Find number range intersection I want to get the intersection range of 2 time ranges. So my question is

What is the efficient mathematical/algorithmic way to get the time range of the intersection of two number ranges ?

  • 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-20T20:43:34+00:00Added an answer on May 20, 2026 at 8:43 pm
        public BTraceStatsTimeRange getOverlap(BTraceStatsTimeRange other) {
        if (!intersect(other)) {
            return NULL;
        }
        long startOther = other.start;
        long endOther = other.end;
        long minEnd = Math.min(end, endOther);
        long maxStart = Math.max(start, startOther);
        return new BTraceStatsTimeRange(Math.min(minEnd, maxStart), Math.max(
                minEnd, maxStart));
    }
    

    I am tired today …. 😉

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

Sidebar

Related Questions

This article describes a way, in C#, to allow the addition of arbitrary value
As addition to this question, I took Ladislav Mrnka's answer . The problem is
In addition to informing the user, we want to collect information for our debugging
I am doing .net programming in addition to c and c++ development and want
This question is slightly different from the kind of finding longest sequence or substring
I asked this question earlier, but I changed the table structure based on recommendations.
EDIT Public health warning - this question includes a false assumption about undefined behaviour.
Before starting, I do have a very particular question and if you want to
Simple question (probably), but I'm buggered if I can find an answer... I have
(See this question and this question for background...) Given: grid = new Slick.Grid(#myGrid, data,

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.