Skip to content

Conversation

@pboyd
Copy link
Member

@pboyd pboyd commented Dec 17, 2025

Description

Replace "min"/"max" string placeholders in named queries with actual numeric minimum/maximum values from filter options.

How Has This Been Tested?

Tested on a dev cluster and unit tests.

Merge criteria:

  • All the commits have been signed-off (To pass the DCO check)
  • The commits have meaningful messages
  • Automated tests are provided as part of the PR for major new functionalities; testing instructions have been added in the PR body (for PRs involving changes that are not immediately obvious).
  • The developer has manually tested the changes and verified that the changes work.
  • Code changes follow the kubeflow contribution guidelines.

@pboyd pboyd changed the title feat(catalog): substitue min/max values for named queries feat(catalog): substitute min/max values for named queries Dec 17, 2025
Replace "min"/"max" string placeholders in named queries with actual
numeric minimum/maximum values from filter options.

Signed-off-by: Paul Boyd <paul@pboyd.io>
Copy link
Member

@jonburdo jonburdo left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

/lgtm

@pboyd
Copy link
Member Author

pboyd commented Jan 5, 2026

/approve

@google-oss-prow
Copy link

[APPROVALNOTIFIER] This PR is APPROVED

This pull-request has been approved by: pboyd

The full list of commands accepted by this bot can be found here.

The pull request process is described here

Details Needs approval from an approver in each of these files:

Approvers can indicate their approval by writing /approve in a comment
Approvers can cancel approval by writing /approve cancel in a comment

@google-oss-prow google-oss-prow bot merged commit bf51eb5 into kubeflow:main Jan 5, 2026
23 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants