I moved the text to a variable before running each test. I should have
mentioned that.
--
Jacqueline Landman Gay | jac...@hyperactivesw.com
HyperActive Software | http://www.hyperactivesw.com
On February 3, 2020 6:14:29 PM Ralph DiMola via use-livecode
wrote:
I can see that if the text is i
I can see that if the text is in a field. When deleting the chars the
remaining text must be reformatted. Try it with the text in a variable.
Ralph DiMola
IT Director
Evergreen Information Services
rdim...@evergreeninfo.net
-Original Message-
From: use-livecode [mailto:use-livecode-boun.
Yes, but I couldn't get the recursion working right. My brain fried.
Bob S
> On Feb 3, 2020, at 11:18 , Ben Rubinstein via use-livecode
> wrote:
>
> On 22/01/2020 18:26, Richard Gaskin via use-livecode wrote:
>> We have many handlers that deliver directory trees as lists, but arrays are
>>
On 2/3/20 2:19 PM, hh via use-livecode wrote:
Parse1 is here always at least 30% faster than Parse2.
I'm seeing the same thing, only more so. I searched for "the" in a 424K
text file:
parse1 = 11 ms
parse2 = 111 ms
The text was imported into a field using the property inspector, which I
as
Also never forget the blazingly fast "filter" when appropriate.
Ralph DiMola
IT Director
Evergreen Information Services
rdim...@evergreeninfo.net
-Original Message-
From: use-livecode [mailto:use-livecode-boun...@lists.runrev.com] On Behalf
Of hh via use-livecode
Sent: Monday, February
Hi all,
Read about new developments in LiveCode open source and the open source
community in today's edition of the "This Week in LiveCode" newsletter!
Read issue #211 here: http://bit.ly/36VTaCf
This is a weekly newsletter about LiveCode, focussing on what's been
going on in and around
Parse1 is here always at least 30% faster than Parse2.
Yet another approach in LC 7/8/9 that I find to be very
fast (especially for a lot of hits in large strings,
e.g. when searching for "and" or "the"):
-- Offset per ItemDelimiter
-- Searches for pStr in pSrc using pCase
function Parse0 pStr, p
On 22/01/2020 18:26, Richard Gaskin via use-livecode wrote:
We have many handlers that deliver directory trees as lists, but arrays are a
different beast. Because the depth is both unknowable and varied, I can't
think of a way to do this without resorting to "do".
Surely this is what recursio
If I execute `mergBLEScanForPeripheralsWithServices` with no parameters, I
then get a shed-load of `mergBLEDidDiscoverPeripheral` messages, as expected
(and as warned by the documentation for the service UUIDs parameter:
If empty all discovered peripherals are returned regardless of their sup
Bob may have much of what you are asking for.
Many years ago I made a form filling stack. The user clicked on various
controls an/or images, and either a popup of available options or a dialog
appeared. It worked as if each image, say, was its own popUp. Once the
selection was made, the user was
LC server sessions occasionally lock up and require the deleting of
everything in the tmp folder.
This has been nagging for a while. I finally have a recipe to reliably
demonstrate this bug.
https://quality.livecode.com/show_bug.cgi?id=22560
Ralph DiMola
IT Director
Evergreen Information Services
Is this going to be strictly an LC app or are you going to try and use the
browser in LC? I have functions that "remember" things typed into a field, and
auto-complete based on what the user types. The weakness is of course that if
you have words that are very similar, especially at the beginnin
I already wrote some functions to do this but sent them to Richard in a demo
stack. Here is the code based on directoryListing, which I believe is in the
MasterLibrary. I made a minor adjustment to it if I recall. DirectoryListing
was returning duplicate paths for each unique folder for some rea
Sannyasin Brahmanathaswami wrote:
hhmm…. how do you
"truncate the string and
search from the beginning"
??
Can you give a code snippet example?
BR
I found this as well. Another thing, it's faster to truncate the string and
search from the beginning than using a "start at" on the entire st
hhmm…. how do you
"truncate the string and
search from the beginning"
??
Can you give a code snippet example?
BR
I found this as well. Another thing, it's faster to truncate the string and
search from the beginning than using a "start at" on the entire string when
searching for all occurrenc
15 matches
Mail list logo
