Find / search case sensitive

Question

Is it possible to do a case sensitive find (search) in Dynamics AX 2009?

For example, when I am searching for "address", I don't want to see "Address" in the results.

you have asked this already http://stackoverflow.com/questions/11056800/dynamics-ax-2009-find-search-for-an-exact-match — AnthonyBlake, Jun 19 '12 at 08:54
I have answered on your original question, here; http://stackoverflow.com/questions/11056800/dynamics-ax-2009-find-search-for-an-exact-match — AnthonyBlake, Jun 19 '12 at 09:53
Well strictly speaking it is two different aspects: case sensitive versus exact search. Maybe we are best to leave it as is. Both questions are vague on there scope. — Jan B. Kjeldsen, Jun 20 '12 at 06:25

score 0 · Answer 1 · answered Jun 18 '12 at 08:11

0

If you have a look at the Find form window that appears when you do a find, look at the properties, this helps you narrow you down your search, unsure about a like-for-like exact match i.e. "address" and blocking out "Address".

answered Jun 18 '12 at 08:11

will

188
1
4
16

score 0 · Answer 2 · edited Jun 20 '20 at 09:12

0

No you cannot.

As mentioned in this answer, the find form uses the match method, which is documented on msdn here.

To quote MSDN;

Remarks

The system does not differentiate between lower and upper case.

edited Jun 20 '20 at 09:12

Community

1
1

answered Jun 20 '12 at 08:45

AnthonyBlake

2,334
1
25
39

Not the answer I hoped for, but it is what it is. Thank you. – Michael Russ Jun 20 '12 at 20:18

score 0 · Accepted Answer · answered Mar 11 '13 at 03:38

Jan,

There IS a way to do it using standard Axapta X++. When you use the find screen there is a tab called 'Filter' where you can place code to do the filtering (no need to complete the fields on the name & location tab). The below code is for illustration purposes only as the below code is not complete and has not been finalised (I leave that to you).

str             toMatch     = 'Address';
str             string;
str             char, charMatch;
int             i, pos;
boolean         ret;
;

pos     = strScan(_treeNodeName, toMatch, 1, strLen(_treeNodeName));
string  = subStr(_treeNodeName, pos, strLen(toMatch));
if (string)
{
    ret             = true;
    for (i=1;i<=strLen(toMatch);i++)
    {
        char        = subStr(toMatch, i, 1);
        charMatch   = subStr(string, i, 1);
        if (char2num(char,1) != char2num(charMatch,1))
        {
            ret     = false;
        }
    }
    if (ret)
    {
        return ret;
    }
}

pos     = strScan(_treeNodeSource, toMatch, 1, strLen(_treeNodeSource));
string  = subStr(_treeNodeSource, pos, strLen(toMatch));
if (string)
{
    ret             = true;
    for (i=1;i<=strLen(toMatch);i++)
    {
        char        = subStr(toMatch, i, 1);
        charMatch   = subStr(string, i, 1);
        if (char2num(char,1) != char2num(charMatch,1))
        {
            ret     = false;
        }
    }
    if (ret)
    {
        return ret;
    }
}
return false;

I haven't tried this, but it sounds plausible. Thanks for the code to get me started. I wonder what kind of of effect on performance the filter will have? — Michael Russ, Mar 13 '13 at 19:52

Find / search case sensitive

3 Answers3