× The internal search function is temporarily non-functional. The current search engine is no longer viable and we are researching alternatives.
As a stop gap measure, we are using Google's custom search engine service.
If you know of an easy to use, open source, search engine ... please contact support@midrange.com.



Another example replacing a string:

// Here I retreive the address and size of the buffer
// setup a new memory store to recieve a replaced
// character string
addr = bufAddr();
size = bufSize();
search = 'xxx';
replace = 'yxyxyx';
store = storeNew();
storeInz(store);

// Here I loop through the buffer
// searchin for 'xxx' that is in pos 77.640
for i = 1 to size-%len(search);
p = addr + i - 1;
if search = %subst(data:1:%len(search));
dsply %char(i);
storeAppendText(store:replace);
else;
storeAppendText(store:%subst(data:1:1));
endif;
endfor;

On Thu, Dec 1, 2011 at 6:04 PM, Henrik Rützou <hr@xxxxxxxxxxxx> wrote:

David,

I have about 100 free high level subprocedures to handle specific
tasks with data in memory. Here is a build and search example:


d i s 10i 0
d search s 65535a varying

d data s 65535a based(p)
d p s *

d addr s *
d size s 10i 0

/free
// Clear Service Program & Responce Object
clearSrvPgm();
setContent('*none');

// Here I build a buffer with 170.005 bytes
// putting 'xxx' in the middle
for i = 1 to 10000;
echo('my data my data');
if i = 4567;
echo('xxx');
endif;
endfor;

// Here I retreive the address and size of the buffer
// and setup a search criteria for 'xxx'
addr = bufAddr();
size = bufSize();
search = 'xxx';

// Here I loop through the buffer
// searching for 'xxx' that is in pos 77.640
for i = 1 to size-%len(search);
p = addr + i - 1;
if search = %subst(data:1:%len(search));
dsply %char(i);
endif;
endfor;

*inlr = *on;
/end-free



On Thu, Dec 1, 2011 at 5:36 PM, John McKay <jmckay@xxxxxxxxxxxxxxxx>wrote:

David,

I have two questions before I post a suggestion ...

First, why do you say you are "not supper[sic] happy with the idea
of having to deal with this data using pointers and C api's ".

Second, what are you looking for in this data or intending to do?


Regards,
John McKay mba
www.rpglanguage.com

On 30/11/2011 16:51, David Gibbs wrote:
Folks:

I've got a problem where I need to analyze and manipulate very large
blocks of character data.

This character data could be well in excess of 64k.

Since the limit for RPG character fields on 5.4 is 64k ... I can't use
normal BIF's.

Upgrading to 6.1 isn't an option due to customer requirements (this was
my first idea, but it got shot down).

My current thought is to use pointers and C functions to analyze the
text in the space.

%alloc to create space and get a pointer

strstr in place of %scan(s)
strlen in place of %len(%trim(s))
strcat& %realloc in place of s1 + s2
strncpy in place of %subst

dealloc when I'm done with the space.

Obviously I would wrapper the C functions in procedures so I don't have
to deal with the individual C api's directly.

I'm not supper happy with the idea of having to deal with this data
using pointers and C api's ... Any suggestions on a different approach to
handling these large character variables?

Thanks!

david

--
This is the RPG programming on the IBM i / System i (RPG400-L) mailing
list
To post a message email: RPG400-L@xxxxxxxxxxxx
To subscribe, unsubscribe, or change list options,
visit: http://lists.midrange.com/mailman/listinfo/rpg400-l
or email: RPG400-L-request@xxxxxxxxxxxx
Before posting, please take a moment to review the archives
at http://archive.midrange.com/rpg400-l.




--
Regards,
Henrik Rützou

http://powerEXT.com <http://powerext.com/>






As an Amazon Associate we earn from qualifying purchases.

This thread ...

Replies:

Follow On AppleNews
Return to Archive home page | Return to MIDRANGE.COM home page

This mailing list archive is Copyright 1997-2024 by midrange.com and David Gibbs as a compilation work. Use of the archive is restricted to research of a business or technical nature. Any other uses are prohibited. Full details are available on our policy page. If you have questions about this, please contact [javascript protected email address].

Operating expenses for this site are earned using the Amazon Associate program and Google Adsense.