IBM Z Software


This portal is to open public enhancement requests against IBM Z Software products. To view all of your ideas submitted to IBM, create and manage groups of Ideas, or create an idea explicitly set to be either visible by all (public) or visible only to you and IBM (private), use the IBM Unified Ideas Portal (https://ideas.ibm.com).


Shape the future of IBM!

We invite you to shape the future of IBM, including product roadmaps, by submitting ideas that matter to you the most. Here's how it works:

Search existing ideas

Start by searching and reviewing ideas and requests to enhance a product or service. Take a look at ideas others have posted, and add a comment, vote, or subscribe to updates on them if they matter to you. If you can't find what you are looking for,

Post your ideas

  1. Post an idea.

  2. Get feedback from the IBM team and other customers to refine your idea.

  3. Follow the idea through the IBM Ideas process.


Specific links you will want to bookmark for future use

Welcome to the IBM Ideas Portal (https://www.ibm.com/ideas) - Use this site to find out additional information and details about the IBM Ideas process and statuses.

IBM Unified Ideas Portal (https://ideas.ibm.com) - Use this site to view all of your ideas, create new ideas for any IBM product, or search for ideas across all of IBM.

ideasibm@us.ibm.com - Use this email to suggest enhancements to the Ideas process or request help from IBM for submitting your Ideas.

Add a new idea Subscribe
Status Not under consideration
Workspace PL/I Compilers
Created by Guest
Created on Feb 5, 2016

RELATED IDEAS

LOOKUP builtin function

Lookups are usually done via

do i=1 to n while(^match)
or
do i = 1 to n until(match)

loops. This type of processing is not efficient even (see the "Use Case" below) if subsequent matches match on a next item in a table.

What is proposed is a new builtin that would use compiler magic to (possibly) make such lookups more efficient.

Idea priority Low
  • Guest
    Reply
    |     Apr 27, 2016

    this is probably best handled by macro or other user-written code

  • Guest
    Reply
    |     Mar 29, 2016

    There is no merit in such a function.

    A better search algorithm, and different ordering of data can have
    a significant effect on execution time.

    For example, if the data is arranged in ascending or descending order,
    a binary search will be significantly faster.

    If the data is ordered according to some hash,
    a hash search will locate the item with just a few probes.

  • Guest
    Reply
    |     Feb 8, 2016

    To be discussed with the team.

  • Guest
    Reply
    |     Feb 7, 2016

    If done, it would be nice if it included an option o do a binary search instead of sequential.

  • Guest
    Reply
    |     Feb 5, 2016

    I do not think that is a good idea. On the one hand you can use the preprocessor. On the other, your desire to let the compiler generate more efficient code is likely already done by replacing induction with shadow variables, at least, that is what I have always done.

By clicking the "Post Comment" or "Submit Idea" button, you are agreeing to the IBM Ideas Portal Terms of Use.
Do not place IBM confidential, company confidential, or personal information into any field.