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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 9, 20262026-06-09T03:23:01+00:00 2026-06-09T03:23:01+00:00

I am trying to efficiently find all the JIRA issues that were closed in

  • 0

I am trying to efficiently find all the JIRA issues that were closed in the last week. Does anyone know how to do this in a nice way?

My messy solution right now is to loop over every issue in a project and compare its closing date and time to the current time. However, the loop must start and end with given keys, such as PROJECT-1000 to PROJECT-2000. This isn’t very satisfying having to hardcode these values in and I don’t want to have to increase the upper bound from 2000 to something higher every time more issues are added. I could choose a very large number that will almost certainly be larger than the highest id number (scan until PROJECT-7777777), but this slows down the program way too much.

(Keep in mind that even old issues with small ids may be closed very recently, meaning that it won’t work to just scan over issues that were created since the last running of the application.)

Any suggestions for an elegant way of doing 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. Editorial Team
    Editorial Team
    2026-06-09T03:23:02+00:00Added an answer on June 9, 2026 at 3:23 am

    You can create a filter using the JQL, and then access it using the SOAP API.

    First, to create the filter, use a query of this sort:

    resolutionDate  >= "-7d"
    

    Than, you can access your filter using the getIssuesFromFilterWithLimit SOAP function.

    By the way, If for any future reason you want to find the highest issue key, check out this answer.

    EDIT

    To find the filter ID, go to http://your.jira.com/ManageFilters.jspa (Manage Filters) and choose the filter. Then in the URL you will see the requestId.

    As @C.Williamson said, there’s also getIssuesFromJqlSearch(token, jqlQuery, maxIssuesReturned), which saves the use of a filter by executing the JQL directly.

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

Sidebar

Related Questions

I'm trying to write an algorithm that will find the set of all vertices
I am trying to find a nice way to find all events of type
I'm trying to find the best (efficient) way of doing this. I have a
I'm trying to work out how to efficiently sort a huge dataset that won't
I'm trying to determine how to find/retrieve/load objects efficiently in terms of a.) minimizing
I am trying to find all the files in the same directory as my
i'm trying to find all the anchor tags and appending the href value with
I'm trying to find the most efficient way to get all objects from the
I'm trying to develop a genetic algorithm that will find the most efficient way
I am trying to write a c++ program to find all numbers with a

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.