# Which is the fastest method to compare two array

## Recommended Posts

I write this script to compare to array, well Do you have a better way to do it?

```#include <Constants.au3>
#include <Array.au3>
#include <File.au3>
#include <MsgBoxConstants.au3>

\$a = FileSelectFolder("seleziona cartella A",@ScriptDir)
\$fold_A = _FileListToArrayRec(\$a,"*",2,1,0,1)

\$b = FileSelectFolder("seleziona cartella B",@ScriptDir)

\$fold_B = _FileListToArrayRec(\$b,"*",2,1,0,1)

\$tota = UBound(\$fold_A)-1
\$totb = UBound(\$fold_B)-1

If \$tota > \$totb Then
findx(\$fold_A,\$fold_B)
Else
findx(\$fold_B,\$fold_A)
EndIf

Func findx(\$min,\$max)
For \$i = 0 To UBound(\$min)-1
\$found = _ArraySearch(\$max, \$min[\$i])
If \$found = -1 Then
ConsoleWrite(\$min[\$i]&@CRLF)
EndIf
Next
EndFunc```

##### Share on other sites

I'm a bit of an AutoIT novice, so excuse the lack of code examples. I think your problem depends on the relative sizes of the two arrays. If one of the arrays is small (2-10 items), then your method is quite effective, the problem will occur when the two arrays are of significant and similar sizes.

If you have a couple of arrays holding 100 000 items each, then that becomes a very large comparison. You could improve things quite a bit by sorting the arrays first and then dividing them into manageable buckets of data. For example, if your stored data is alpanumeric then make 36 arrays, depending on the first letter of your data 0-9 a-z. Then you only have to compare your "a" bucket to your "a" bucket. The overhead of creating the buckets versus your simplistic search of the entire range will depend on the data...

Any help?

Edit: You don't need to split the smaller array into buckets, just the large one, then iterate the small one.

Second Edit (sorry!): Obviously this can be more sophisticated, if you don't have a uniform data distribution, change your strategy - you want to try and make the buckets near uniform size.

Edited by SlackerAl
• 1

Problem solving step 1: Write a simple, self-contained, running, replicator of your problem.

##### Share on other sites

Seems an intermediate solution (in terms of effort) would be to sort the large array and then use _ArrayBinarySearch perhaps?

• 1

Problem solving step 1: Write a simple, self-contained, running, replicator of your problem.

##### Share on other sites

You might have a look at this thread. For comparing 1D arrays the Scripting.Dictionary way is by far much faster

• 1

##### Share on other sites

Like this..

```#include <Constants.au3>
#include <Array.au3>
#include <File.au3>
#include <MsgBoxConstants.au3>

\$a = FileSelectFolder("seleziona cartella A",@ScriptDir)
\$fold_A = _FileListToArrayRec(\$a,"*",2,1,0,1)

\$b = FileSelectFolder("seleziona cartella B",@ScriptDir)

\$fold_B = _FileListToArrayRec(\$b,"*",2,1,0,1)

\$tota = UBound(\$fold_A)-1
\$totb = UBound(\$fold_B)-1

If \$tota > \$totb Then
findx(\$fold_A,\$fold_B)
Else
findx(\$fold_B,\$fold_A)
EndIf

Func findx(\$min,\$max)
_ArraySort(\$min, 0, 1)
_ArraySort(\$max, 0, 1)
For \$i = 0 To UBound(\$min)-1
\$found = _ArrayBinarySearch(\$max, \$min[\$i], 1)
If \$found = -1 Then
ConsoleWrite(\$i&" "&\$min[\$i]&@CRLF)
EndIf
Next
EndFunc```

##### Share on other sites

not tested but something like below.

Better way is hard to say as that depends on your requirements, speed wanted etc. maybe powershell is quicker on the cmdline just comparing 2 folders.

```#include <Constants.au3>
#include <Array.au3>
#include <File.au3>
#include <MsgBoxConstants.au3>

\$a = FileSelectFolder("seleziona cartella A",@ScriptDir)
\$fold_A = _FileListToArrayRec(\$a,"*",2,1,0,1)

\$b = FileSelectFolder("seleziona cartella B",@ScriptDir)

\$fold_B = _FileListToArrayRec(\$b,"*",2,1,0,1)

\$tota = UBound(\$fold_A)-1
\$totb = UBound(\$fold_B)-1

_ArraySort(\$fold_a, 0, 1)
_ArraySort(\$fold_b, 0, 1)

\$i=1
\$j=1
while (\$i < \$totA) or (\$j<totB)
if \$fold_a[\$i]=\$fold_b[\$j] then
consolewrite("Equal")
\$i=\$i+1
\$j=\$j+1
elseif \$fold_a[\$i]<\$fold_b[\$j] then
consolewrite("Not Equal")
\$i=\$i+1
else
consolewrite("Not Equal")
\$j=\$j+1
endif
wend```

##### Share on other sites

It all depends on what you call "equal" applied to arrays.

In my book, [London", "Paris", "Melbourne"] is definitely not equal to [London", "Melbourne", "Paris"]. Both arrays contain the same elements but they are certainly not equal. Similarly to itineraries, a picture on screen isn't equal to the same picture once flipped or with all pixels moved around.

It's only when you consider 1D arrays and call them sets that {4, 31, 9} = {9, 4, 31}

This wonderful site allows debugging and testing regular expressions (many flavors available). An absolute must have in your bookmarks.
RegExp tutorial: enough to get started
PCRE v8.33 regexp documentation latest available release and currently implemented in AutoIt beta.

SQLitespeed is another feature-rich premier SQLite manager (includes import/export). Well worth a try.
SQLite Expert (freeware Personal Edition or payware Pro version) is a very useful SQLite database manager.
An excellent eBook covering almost every aspect of SQLite3: a must-read for anyone doing serious work.
SQL tutorial (covers "generic" SQL, but most of it applies to SQLite as well)
A work-in-progress SQLite3 tutorial. Don't miss other LxyzTHW pages!
SQLite official website with full documentation (may be newer than the SQLite library that comes standard with AutoIt)

##### Share on other sites

I just have to compare the contents of two folders. With a sort of arrays before the loop for the comparison gets fast, _ArrayBinarySearch run very fats, 4 example in this moment I run a diff for to folders with 26.186 files, 172 folders TOT 249 GB I have a correct result in a few seconds.

With winmerge.... after 15 min I have 50% of total process....

Another method could be the C++ memcmp function.

Thx guys.

##### Share on other sites

?

```#include <Constants.au3>
#include <Array.au3>
#include <File.au3>

\$a = FileSelectFolder("seleziona cartella A",@ScriptDir)
\$fold_A = _FileListToArrayRec(\$a,"*",2,1,0,1)

\$b = FileSelectFolder("seleziona cartella B",@ScriptDir)
\$fold_B = _FileListToArrayRec(\$b,"*",2,1,0,1)

local \$big = (UBound(\$fold_A)>UBound(\$fold_B)) ? \$fold_A : \$fold_B
local \$small = (UBound(\$fold_A)<=UBound(\$fold_B)) ? \$fold_A : \$fold_B
findx(\$small, \$big)

Func findx(\$min, \$max)
Local \$sd = ObjCreate("Scripting.Dictionary")
\$sd.CompareMode = 1   ; case insensitive
For \$i In \$max
\$sd.Item(\$i)
Next
For \$i In \$min
If \$sd.Exists(\$i) Then \$sd.Remove(\$i)
Next
\$asd = \$sd.Keys()
_ArrayDisplay(\$asd, "\$asd")
EndFunc```

• 1

##### Share on other sites

Your approach is a bit faster, it would be nice to do a test with a huge amount and variety of data to understand the differences in practical terms.

##### Share on other sites
18 minutes ago, rootx said:

I just have to compare the contents of two folders. With a sort of arrays before the loop for the comparison gets fast, _ArrayBinarySearch run very fats, 4 example in this moment I run a diff for to folders with 26.186 files, 172 folders TOT 249 GB I have a correct result in a few seconds.

With winmerge.... after 15 min I have 50% of total process....

15 minutes?
Does this mean you not just compare the file and directory names but the file contents as well?
Just comparing the file/directory names should happen in under a minute.

My UDFs and Tutorials:

Spoiler

UDFs:
Active Directory (NEW 2017-04-18 - Version 1.4.8.0) - Download - General Help & Support - Example Scripts - Wiki
OutlookEX (NEW 2017-02-27 - Version 1.3.1.0) - Download - General Help & Support - Example Scripts - Wiki
ExcelChart (2015-04-01 - Version 0.4.0.0) - Download - General Help & Support - Example Scripts
Excel - Example Scripts - Wiki
Word - Wiki
PowerPoint (2015-06-06 - Version 0.0.5.0) - Download - General Help & Support

Tutorials:

##### Share on other sites

If the amount of data is really huge then maybe it's worth a try to the SQLite way (untested, possible typos...)

```#include <SQLite.au3>
;#include <SQLite.dll.au3>
#include <Array.au3>

\$a = FileSelectFolder("seleziona cartella A",@ScriptDir)
\$fold_A = _FileListToArrayRec(\$a,"*",2,1,0,1)

\$b = FileSelectFolder("seleziona cartella B",@ScriptDir)
\$fold_B = _FileListToArrayRec(\$b,"*",2,1,0,1)

\$res = _ArrayCompareAndGetData(\$fold_A, \$fold_B, 1)
_ArrayDisplay(\$res)
\$res = _ArrayCompareAndGetData(\$fold_A, \$fold_B, 0)
_ArrayDisplay(\$res)

;==============================================================
; \$flag = 1 : return items from array1 which don't exist in array2 (with index)
; \$flag = 2 : return items from array2 which don't exist in array1 (with index)
; \$flag = 0 : return both
;==============================================================

Func _ArrayCompareAndGetData(\$array1, \$array2, \$flag = 0)
If (not IsArray(\$array1) AND \$array1<>"") OR _
(not IsArray(\$array2) AND \$array2<>"") Then Return SetError(1, 0, 0)
If \$flag < 0 OR \$flag > 2 Then \$flag = 0
If \$array2 = "" Then \$flag = 1  ;Return SetError(2, 0, \$array1)
If \$array1 = "" Then Return SetError(3, 0, \$array2)
Local \$array, \$aTemp, \$iRows, \$iColumns
_SQLite_Startup()
_SQLite_Open()   ; ':memory:'
_SQLite_Exec (-1, "CREATE TABLE table1 (id, items1); CREATE TABLE table2 (id, items2);")
_SQLite_Exec(-1, "Begin;")
For \$i = 0 to UBound(\$array1)-1
_SQLite_Exec(-1, "INSERT INTO table1 VALUES (" & \$i & ", " & _SQLite_FastEscape(\$array1[\$i]) & ");")
Next
For \$i = 0 to UBound(\$array2)-1
_SQLite_Exec(-1, "INSERT INTO table2 VALUES (" & \$i & ", " & _SQLite_FastEscape(\$array2[\$i]) & ");")
Next
_SQLite_Exec(-1, "Commit;")

Switch \$flag
Case 1
_SQLite_GetTable2d(-1, "SELECT * FROM table1 WHERE items1 NOT IN (SELECT items2 FROM table2) ;", \$array, \$iRows, \$iColumns)
\$array[0][0] = UBound(\$array)-1
\$array[0][1] = ""

Case 2
_SQLite_GetTable2d(-1, "SELECT * FROM table2 WHERE items2 NOT IN (SELECT items1 FROM table1) ;", \$array, \$iRows, \$iColumns)
\$array[0][0] = UBound(\$array)-1
\$array[0][1] = ""

Case 0
_SQLite_GetTable2d(-1, "SELECT * FROM table1 WHERE items1 NOT IN (SELECT items2 FROM table2) ;", \$array, \$iRows, \$iColumns)
_SQLite_GetTable2d(-1, "SELECT * FROM table2 WHERE items2 NOT IN (SELECT items1 FROM table1) ;", \$aTemp, \$iRows, \$iColumns)
Local \$n = UBound(\$array)-1, \$m = UBound(\$aTemp)-1
Local \$s = (\$n > \$m) ? \$n : \$m
Redim \$array[\$s+1][4]
For \$i = 0 to \$m
\$array[\$i][2] = \$aTemp[\$i][0]
\$array[\$i][3] = \$aTemp[\$i][1]
Next
\$array[0][0] = \$n
\$array[0][1] = ""
\$array[0][2] = \$m
\$array[0][3] = ""

EndSwitch

_SQLite_Close()
_SQLite_Shutdown()
Return \$array
EndFunc```

##### Share on other sites

@junkew got me thinking powershell

```#include <AutoItConstants.au3>

\$folderA="'DIRTEST\A'"
\$folderB="'DIRTEST\B'"

\$iPid = run("cmd /c powershell \$dir1 = " & \$folderA & " ; \$dir2 = " & \$folderB & " ; \$d1 = get-childitem -path \$dir1 -recurse ; \$d2 = get-childitem -path \$dir2 -recurse ; (compare-object \$d1 \$d2)" ,"" ,@SW_HIDE, \$STDOUT_CHILD)

\$sOut = ""

While 1
If @error Then ExitLoop
WEnd

msgbox(0, '' , \$sOut)```

Edited by iamtheky

```,-. .--. ________ .-. .-. ,---. ,-. .-. .-. .-.
|(| / /\ \ |\ /| |__ __||| | | || .-' | |/ / \ \_/ )/
(_) / /__\ \ |(\ / | )| | | `-' | | `-. | | / __ \ (_)
| | | __ | (_)\/ | (_) | | .-. | | .-' | | \ |__| ) (
| | | | |)| | \ / | | | | | |)| | `--. | |) \ | |
`-' |_| (_) | |\/| | `-' /( (_)/( __.' |((_)-' /(_|
'-' '-' (__) (__) (_) (__)```

##### Share on other sites
6 hours ago, rootx said:

With a sort of arrays before the loop for the comparison gets fast, _ArrayBinarySearch run very fast.

With initial sorting you don't even have to use dichotomy (_ArrayBinarySearch) for comparing contents, as just a linear scan of both arrays in parallel will do. You gain a log2 N factor.

This wonderful site allows debugging and testing regular expressions (many flavors available). An absolute must have in your bookmarks.
RegExp tutorial: enough to get started
PCRE v8.33 regexp documentation latest available release and currently implemented in AutoIt beta.

SQLitespeed is another feature-rich premier SQLite manager (includes import/export). Well worth a try.
SQLite Expert (freeware Personal Edition or payware Pro version) is a very useful SQLite database manager.
An excellent eBook covering almost every aspect of SQLite3: a must-read for anyone doing serious work.
SQL tutorial (covers "generic" SQL, but most of it applies to SQLite as well)
A work-in-progress SQLite3 tutorial. Don't miss other LxyzTHW pages!
SQLite official website with full documentation (may be newer than the SQLite library that comes standard with AutoIt)

##### Share on other sites

If there is only one row in one of the arrays and 100,000 rows in the other array, I doubt that a linear search is faster on average.

Even with the same number of rows in the two arrays, it's easy to make examples where a binary search is faster. It depends on the data.

• 1

##### Share on other sites

I do mean what I wrote: "a linear scan of both arrays in parallel".

This wonderful site allows debugging and testing regular expressions (many flavors available). An absolute must have in your bookmarks.
RegExp tutorial: enough to get started
PCRE v8.33 regexp documentation latest available release and currently implemented in AutoIt beta.

SQLitespeed is another feature-rich premier SQLite manager (includes import/export). Well worth a try.
SQLite Expert (freeware Personal Edition or payware Pro version) is a very useful SQLite database manager.
An excellent eBook covering almost every aspect of SQLite3: a must-read for anyone doing serious work.
SQL tutorial (covers "generic" SQL, but most of it applies to SQLite as well)
A work-in-progress SQLite3 tutorial. Don't miss other LxyzTHW pages!
SQLite official website with full documentation (may be newer than the SQLite library that comes standard with AutoIt)

##### Share on other sites

Lot of focus on the solution comparing 2 arrays not sure if the solution is right to the problem

But looking at the problem it seems to be

• n folders with m files
• find the duplicates and report the folder?

Solution direction with 1 array

`dir c: /b /s > c_files.txt`

or

```dir c:\folder1 /b /s > files.txt
dir c:\folder2 /b /s >> files.txt```

and then some code as a solution direction to validate (not run/tested)

• missing part to sort it first (but then i need 2 columns: one with filename and 1 with foldername)
```#include <Constants.au3>
#include <Array.au3>
#include <File.au3>
#include <MsgBoxConstants.au3>

Run(@ComSpec & " /k dir c:\tmp")

\$sFilePath = @TempDir & "\filedata.txt"

\$totA = ubound(\$aRetArray)

\$i=1
while (\$i < \$totA-1)
if \$aRetArray[\$i]=\$aRetArray[\$i+1] then
consolewrite("Duplicate file")
\$i=\$i+1
endif
wend```

##### Share on other sites

Comparing two arrays in two ways: Binary search and linear scan:

```;#AutoIt3Wrapper_UseX64=y

#AutoIt3Wrapper_Au3Check_Parameters=-d -w 1 -w 2 -w 3 -w 4 -w 5 -w 6

Opt( "MustDeclareVars", 1 )

;#include <Array.au3>

Example()

Func Example()
; Read 10,000 unique ascendingly sorted strings into \$aAr1
Local \$aAr1 = FileReadToArray( "tst00.txt" )
Local \$iRows = UBound( \$aAr1 )
;_ArrayDisplay( \$aAr1 )

For \$i = 0 To \$iRows - 2
If \$aAr1[\$i] = \$aAr1[\$i+1] Then ConsoleWrite( "Strings " & \$i & " and " & \$i + 1 & " are identical" & @CRLF )
Next

; Copy 100 uniformly distributed strings from \$aAr1 into \$aAr2
; Add a "x" to every second string to make them different
; \$aAr2 is also unique and ascendingly sorted
; 50 identical strings in \$aAr1 and \$aAr2
; 50 different strings in \$aAr1 and \$aAr2
Local \$aAr2[100]
For \$i = 0 To 99
\$aAr2[\$i] = \$aAr1[\$i*100+99]
If Mod( \$i, 2 ) Then \$aAr2[\$i] &= "x"
Next
;_ArrayDisplay( \$aAr2 )

Local \$hTimer, \$t, \$t1 = 0, \$t2 = 0
Local \$s, \$lo, \$hi, \$mi
Local \$iTests = 10

For \$k = 0 To \$iTests - 1

; Compare \$aAr1 and \$aAr2 through
; a binary search and a linear scan.
; It's utilized that both arrays are sorted.

; Binary search
\$mi = -1
\$hTimer = TimerInit()
For \$i = 0 To 99
\$s = \$aAr2[\$i]
For \$j = \$mi + 1 To \$iRows - 1
\$lo = \$j
\$hi = \$iRows - 1
Do
\$mi = Int( ( \$lo + \$hi ) / 2 )
Switch StringCompare( \$s, \$aAr1[\$mi] )
Case -1
\$hi = \$mi - 1
Case  1
\$lo = \$mi + 1
Case  0
;ConsoleWrite( "Found OK: \$i, \$mi, \$s = " & \$i & ", " & \$mi & ", " & \$s & @CRLF )
ExitLoop 2
EndSwitch
Until \$lo > \$hi
;ConsoleWrite( "Found NO: \$i, \$mi, \$s = " & \$i & ", " & \$mi & ", " & \$s & @CRLF )
ExitLoop
Next
Next
\$t = TimerDiff( \$hTimer )
ConsoleWrite( "Test " & \$k & " Binary search: " & \$t & @CRLF )
\$t1 += \$t

; Linear scan
\$j = -1
\$hTimer = TimerInit()
For \$i = 0 To 99
\$s = \$aAr2[\$i]
For \$j = \$j + 1 To \$iRows - 1
Switch StringCompare( \$aAr1[\$j], \$s )
Case  0
;ConsoleWrite( "Found OK: \$i, \$j, \$s = " & \$i & ", " & \$j & ", " & \$s & @CRLF )
ExitLoop
Case 1
;ConsoleWrite( "Found NO: \$i, \$j, \$s = " & \$i & ", " & \$j & ", " & \$s & @CRLF )
ExitLoop
EndSwitch
Next
Next
\$t = TimerDiff( \$hTimer )
ConsoleWrite( "Test " & \$k & " Linear scan:   " & \$t & @CRLF )
\$t2 += \$t

Next

ConsoleWrite( @CRLF )
ConsoleWrite( "Average Binary search: " & \$t1/\$iTests & @CRLF )
ConsoleWrite( "Average Linear scan:   " & \$t2/\$iTests & @CRLF )
EndFunc```

Console output:

```Test 0 Binary search: 2.74602585342339
Test 0 Linear scan:   10.0892624626688
Test 1 Binary search: 2.6498927853102
Test 1 Linear scan:   9.90807794812693
Test 2 Binary search: 3.73727691310346
Test 2 Linear scan:   12.7233639370786
Test 3 Binary search: 2.68950958283235
Test 3 Linear scan:   10.5594002626344
Test 4 Binary search: 2.70751721806969
Test 4 Linear scan:   10.0164008000931
Test 5 Binary search: 4.07360413122856
Test 5 Linear scan:   9.97927736744995
Test 6 Binary search: 2.5834030552031
Test 6 Linear scan:   9.90918611029538
Test 7 Binary search: 2.49724344660598
Test 7 Linear scan:   9.86818411006267
Test 8 Binary search: 2.49004039251104
Test 8 Linear scan:   9.85100759645166
Test 9 Binary search: 2.56511837942365
Test 9 Linear scan:   9.85322392078857

Average Binary search: 2.87396317577114
Average Linear scan:   10.275738451565```

Anything wrong with code or results?

tst00.au3 and tst00.txt: Arrays.7z

Edited by LarsJ

##### Share on other sites

Binary search only works if the elements have been  sorted. Since initial sorting is required, then a linear scan (comparison) should be faster. How can it be otherwise?

Edit: I believe the problem with the code is that you start the linear scan at element 0 on each run. You are testing the same elements over and over again.

Edited by czardas

##### Share on other sites

From around post 5 it has been assumed that both arrays are sorted.

I do not start the linear scan at element 0 on each run. I'm not testing the same elements over and over again. Read the code.

And I'm pretty sure nothing is wrong with the code. It was a rhetorical question.

## Create an account

Register a new account

• ### Similar Content

• By Iceburg
Hi everyone, I'm at best a noobie.  I have read through the Array helps, and specifically the 2D array help file, and I'm struggling to get my code working.
I have an array that is read from a file, thats working great.  I'm trying to do some math on the array, so I can find the largest, average, lowest, day over day change %, etc.
The array read working fine, I get 43 lines, line 0 is 44, and then I get data that looks like
0519 \$10,000
0520 \$10,001
0521 \$10,002
The data in this array is a single 1D array, breaking it out into 2 columns so I can do the math is what I can get to happen.
How do I reference the array to store this data?  Second, how do I assign this data to the appropriate row/column?
Dim \$all_cash_amounts[UBound(\$aInput)][2] Dim \$max_amount_in_account Dim \$min_amount_in_account _FileReadToArray(\$LC_Check_file_path, \$aInput) _ArrayDisplay(\$aInput) local \$date = StringRegExp(\$aInput[1], "(\d\d\d\d)", 1) local \$cash = StringRegExp(\$aInput[1], "\d+\s(-?[0-9\.\,]+)", 1) ConsoleWrite("Date is: " & \$date & @CRLF) For \$i = 1 To UBound(\$aInput)-1     \$date = StringRegExp(\$aInput[\$i], "(\d\d\d\d)", 1)     \$all_cash_amounts[\$i][2] = \$date[\$i][0], \$cash[\$i][1]      Next _ArrayDisplay(\$all_cash_amounts)
• By OldGuyWalking
Given an array with multiple columns that is displayed in a listview,
===> What is the fastest/most efficient way to create and manage multiple filters and display results in ListView.
I have a text file that loads into a listview that has string, numeric, and date columns.  The main file contains about 5100 rows. It's loaded into an array and (in this ListView) it's pre-filtered to display a range of rows based on a start and end date.  On the form I have menu options for various filters. (see below).
I have options to filter on an "Air Date" column (=Today, >=Today, <=Today) and on a numeric field that is either 1 or 0 that indicate Active or Ended.

For each filter option I have a prebuilt array that holds a subset of the main array based on a single filter.  For the list above I have the main Array and 5 additional arrays.  None of the arrays are updated since this is for "view only" purposes.  This is a short list and I could have done the filtering "live" but I have several of these forms and so kept the same functionality in each. I have another ListView that displays the complete 5100 row list with 3 filters that, when building the filters live was considerably slower than using prebuilt arrays.
If I want to expand past simple single column filtering, using an array for each filter becomes cumbersome especially if I want to combine filters using AND & OR.
The text file I'm working with has 16 columns. If I setup filters for 4 columns and include AND / OR capability that would require prebuilding 24 arrays to cover the various combinations.
If using the slower method of building a filtered array in real time each time a different filter is selected is the only way to go with this then I'll live with it. It is less overhead. .
Below is the code I'm currently using to "filter" an array.  My next change was going to add AND / OR functionality (see the info above the header for where I was going with this) .
; Description ...: Delete rows from an array and only keep rows that meet the crtieria of identified columns. ; ; Next Change: Add AND/OR to combine filters. Use array to hold multiple criteria and values? ; ; Local \$aCriteria[][] = [["",\$iColNbr1, \$sOperator1, \$vValue1], ["AND",\$iColNbr2, \$sOperator2, \$vValue2], ["OR",\$iColNbr3, \$sOperator3, \$vValue3]] ; The first set of criteria ["", \$iColNbr1, \$sOperator1, \$vValue1] must start with a "". ; If anything is entered in that first parameter it will be ignored. ; If the first parameter in any additional criteria set is left blank, or it is not OR, it will default to AND. ; If \$aArray is 1 dimension with more than one set of criteria, only the first set will be used. ; Any criteria that uses a column that is less than 0 or higher than the total number of columns in the array will return an error. ; ; Recognized data types for this function are: S (String), D (Date), N (Number). ; ; Recognized Operators are: "EQ", "NEQ", "IN", "GT", "GE", "LT", "LE", "BETWEEN". ; ****** Not all operators work with all data types. ; #FUNCTION# ==================================================================================================================== ; Name ..........: _ArrayFilter ; Description ...: Delete rows from an array and only keep rows that meet the crtieria of identified columns. ; Syntax ........: _ArrayFilter(Byref \$aArray[, \$iCol = 0[, \$sOperator = "EQ"[, \$vValue = ""[, \$iOptionBase = 0]]]]) ; Parameters ....: \$aArray - Array being filtered. ; \$iCol - [optional] Column to filter. Default is 0. ; \$sOperator - [optional] Operator. Default is "EQ". ; \$vValue - [optional] Criteria to compare the column/row value against. ; \$iOptionBase - [optional] Starting row. Default is 0. ; Return values .: None ; Author ........: OldGuyWalking ; Modified ......: ; Remarks .......: ; Related .......: ; Link ..........: ; Example .......: No ; =============================================================================================================================== Func _ArrayFilter(ByRef \$aArray, \$iCol = 0, \$sOperator = "EQ", \$vValue = "", \$iOptionBase = 0) Local \$hFunc = _ArrayFilter \$vValue = StringStripWS(\$vValue, 3) If \$vValue = "[Today]" Then \$vValue = _NowCalcDate() EndIf Local \$sMsg Local \$sMsgHdr Local \$n1 Local \$sDeleteIndex Local \$aDeleteIndex Local \$iCnt = 0 Local \$iRows Local \$iColMax Local \$iDim Local \$sData Local \$sVType Local \$sDType Local \$LBound Local \$iDiff If \$iOptionBase <> 0 Then \$iOptionBase = 1 EndIf If _IsValueEmpty(\$aArray) Then Return SetError(1, 0, "") EndIf \$iDim = UBound(\$aArray, \$UBOUND_DIMENSIONS) If \$iDim = 1 Then If \$iCol <> 0 Then \$iCol = 0 EndIf EndIf If \$iDim = 2 Then \$iColMax = UBound(\$aArray, \$UBOUND_COLUMNS) - 1 If \$iCol > \$iColMax Or \$iCol < 0 Then Return SetError(1, 0, "") EndIf EndIf If Not _IsBetween(\$iDim, 1, 2) Then ;############### MSG2 - START ############### \$sMsgHdr = FuncName(\$hFunc) & " :Line: " & @ScriptLineNumber & " :Error= " & @error \$sMsg = "Invalid Dimensioned Array. Must be a 1 or 2 dimensional array." MsgBox(0, \$sMsgHdr, \$sMsg) Return SetError(1, 0, "") ;############### MSG2 - END ############### EndIf ; Identify what the value is ; If it is not a String, Int, Number, or Date then skip. Select Case _DateIsValid(\$vValue) = 1 \$sVType = "D" Case IsNumber(\$vValue) = 1 \$sVType = "N" Case IsString(\$vValue) = 1 \$sVType = "S" Case Else ;############### MSG2 - START ############### \$sMsgHdr = FuncName(\$hFunc) & " :Line: " & @ScriptLineNumber & " :Error= " & @error \$sMsg = "Comparison value must be a " & @CRLF & _ "1. Date in YYYY/MM/DD format " & @CRLF & _ "2. A string " & @CRLF & _ "3. A number " & @CRLF MsgBox(0, \$sMsgHdr, \$sMsg) Return SetError(1, 0, "") ;############### MSG2 - END ############### EndSelect \$iCnt = 0 For \$n1 = UBound(\$aArray) - 1 To \$iOptionBase Step -1 If \$iDim = 1 Then \$sData = StringStripWS(\$aArray[\$n1], 3) ElseIf \$iDim = 2 Then \$sData = StringStripWS(\$aArray[\$n1][\$iCol], 3) EndIf Select Case _DateIsValid(\$sData) = 1 \$sDType = "D" Case IsNumber(\$sData) = 1 \$sDType = "N" Case IsString(\$sData) = 1 \$sDType = "S" Case Else \$sDType = "U" EndSelect If _IsValueEmpty(\$sData) Then \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop ; \$sDType = \$sVType EndIf If Not _IsValueEmpty(\$sData) And \$sDType <> \$sVType Then \$sDeleteIndex = \$sDeleteIndex & \$n1 & "," \$iCnt += 1 ContinueLoop EndIf Select Case \$sOperator = "EQ" Switch \$sDType Case "D" \$iDiff = _DateDiff("D", \$vValue, \$sData) If \$iDiff = 0 Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "S" If \$sData = \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "N" If \$sData = \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch Case \$sOperator = "NEQ" Switch \$sDType Case "D" If \$sData <> \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "S" If \$sData <> \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "N" If \$sData <> \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch Case \$sOperator = "IN" Switch \$sDType Case "S" If StringInStr(\$sData, \$vValue) Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch Case \$sOperator = "GT" Switch \$sDType Case "N" If \$sData > \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "D" \$iDiff = _DateDiff("D", \$vValue, \$sData) If \$iDiff > 0 Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch Case \$sOperator = "GE" Switch \$sDType Case "N" If \$sData >= \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "D" \$iDiff = _DateDiff("D", \$vValue, \$sData) If \$iDiff >= 0 Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch Case \$sOperator = "LT" Switch \$sDType Case "N" If \$sData < \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "D" \$iDiff = _DateDiff("D", \$vValue, \$sData) If \$iDiff < 0 Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch Case \$sOperator = "LE" Switch \$sDType Case "N" If \$sData <= \$vValue Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop Case "D" \$iDiff = _DateDiff("D", \$vValue, \$sData) If \$iDiff <= 0 Then ContinueLoop EndIf \$sDeleteIndex &= \$n1 & "," \$iCnt += 1 ContinueLoop EndSwitch EndSelect Next If \$iCnt > 0 Then _DeleteArrayRows(\$aArray, \$sDeleteIndex) EndIf EndFunc ;==>_ArrayFilter Thanks in advance.
OldGuyWalking
• By MyEarth
Hello. I have a 1D array. Is made in this way:
1. This is a line Messages: a message etc Context: a context etc 2. This is a line Messages: a message etc Context: a context etc 3. This is a line Messages: a message etc Correction: a correction etc Context: a context etc I need to make something like:
1. This is a line|Messages: a message etc|Context: a context etc 2. This is a line|Messages: a message etc|Context: a context etc 3. This is a line|Messages: a message etc|Correction: a correction|Context: a context etc For exporting in another software. I need to split every time there is a number when the line start, can be 1. until something like 3.976. Since i don't know if there a 2 line after a number or 3 i have opened this thread. Thanks
• By FMS
Hello,
The last couple of day's I was searching on this forum for the best way to put array's inside array's.
The best example's i found where a little outdatet (2010) whit a lot of pro's and con's.
Now I've a big script where a lot of computations and big array's are involved, so speed is a big issue.
Also I wanna try the script below but don't know iff speed is a problem this way or maybe there is a better way to do this.

Does somebody know's the best way to put array's inside array's and get the data back from them?
(maybe something totaly wrong but I'm open for sugestions)
I'm doing it this way because I don't think I can access the data inside the array (and doing some calculations to it) some other way if the array is inside another array.
Or is there?
#include <Array.au3> Global \$aArray[Random(5,10,1)][Random(5,10,1)] Global \$Holder[2][2] For \$x = 0 To UBound(\$aArray,1) - 1 For \$y = 0 To UBound(\$aArray,2) - 1 \$aArray[\$x][\$y] = Round(Random(-1,1),4) Next Next \$Holder[0][0] = \$aArray \$aArray = "" Global \$get_array = \$Holder[0][0] _ArrayDisplay(\$get_array)
• By FMS
Hello,
I'm trying to randomly change some cells in a array on a given percentage.
at this point I 've a array whit all 0's and want to change some cells to 1.
I'm not shure how to do this in a good coding sort of way.
Also maybe there is a build in function whish I'm not aware of.
Does somebody know how I can do this in a easy way?
I was trying to get the total count of cells and get the percentage of it.
And was stuck when i wanna change the cell.
#include <Array.au3> Global \$percentage = 0.2 Global \$aArray[Random(10,30,1)][Random(10,30,1)] For \$x = 0 To UBound(\$aArray,1) - 1 For \$y = 0 To UBound(\$aArray,2) - 1 \$aArray[\$x][\$y] = 0 Next Next _ArrayDisplay(\$aArray) randomize() _ArrayDisplay(\$aArray) Func randomize() Local \$total_to_change = ((UBound(\$aArray,1) * UBound(\$aArray,2)) / 100) * \$percentage ConsoleWrite( "\$total_to_change = " & \$total_to_change & @LF ) ConsoleWrite( "total in array = " & (UBound(\$aArray,1) * UBound(\$aArray,2)) & @LF ) EndFunc
×

• Wiki

• Back

• Git