Currently it is quite difficult to search for a particular device by either device model, Vendor ID or Model ID on the Fieldbus Foundation website.
The following provides a means to easily search this data, via the offline tool ‘Foundation Fieldbus device search’.
The tool enables searching via Vendor, Model, Type and even Vendor and Model IDs.
Download the Foundation Fieldbus Device Search tool.
Download the raw text file output.
From Wikipedia, The longest common subsequence (LCS) problem is to find the longest subsequence common to all sequences in a set of sequences (often just two).
The following is a VBA implementation of this problem. The following functions are included;
String functions;
Array functions;
Common functions;
Examples;
Unfortunately, the limitations of VBA makes a dog’s dinner out of what would be some very concise code or, perhaps that’s just my implementation…
Option Explicit
Public Function longestCommonSubsequence(ByRef string1 As String, ByRef string2 As String) As Long()
If string1 = vbNullString Or string2 = vbNullString Then
Exit Function
End If
Dim num() As Long
'define the array, note rows of zeros get added to front automatically
ReDim num(Len(string1), Len(string2))
Dim i As Long, j As Long
For i = 1 To Len(string1)
For j = 1 To Len(string2)
If Mid$(string1, i, 1) = Mid$(string2, j, 1) Then
num(i, j) = num(i - 1, j - 1) + 1
Else
num(i, j) = max(num(i - 1, j), num(i, j - 1))
End If
Next j
Next i
longestCommonSubsequence = num
End Function
Sub exampleString()
Dim arr() As Long
Dim string1 As String
Dim string2 As String
string1 = "this is a find the haystack string"
string2 = "this is a replace the needle string"
arr = longestCommonSubsequence(string1, string2)
Dim s As String, t As String
s = backTraceUp(arr, string1, string2, Len(string1), Len(string2))
t = backTraceLeft(arr, string1, string2, Len(string1), Len(string2))
Dim a As String, b As String
a = getDiff(arr, string1, string2, Len(string1), Len(string2))
Dim brr() As Long
brr = passGetDiffOutput(a)
End Sub
Public Function max(ByRef a As Long, ByRef b As Long) As Long
If a >= b Then
max = a
Else
max = b
End If
End Function
'back traces c, defaulting in the up direction
Public Function backTraceUp(ByRef c() As Long, ByRef string1 As String, ByRef string2 As String, ByRef i As Long, ByRef j As Long) As String
If i < 1 Or j < 1 Then
backTraceUp = vbNullString
ElseIf Mid$(string1, i, 1) = Mid$(string2, j, 1) Then
'equal characters, save it and then go up and left
backTraceUp = backTraceUp(c, string1, string2, i - 1, j - 1) & Mid$(string1, i, 1)
Else
'go in the direction of the highest number, defaulting to up
If (c(i, j - 1) > c(i - 1, j)) Then
backTraceUp = backTraceUp(c, string1, string2, i, j - 1)
Else
backTraceUp = backTraceUp(c, string1, string2, i - 1, j)
End If
End If
End Function
'back traces c, defaulting in the left direction
Public Function backTraceLeft(ByRef c() As Long, ByRef string1 As String, ByRef string2 As String, ByRef i As Long, ByRef j As Long) As String
If i < 1 Or j < 1 Then
backTraceLeft = vbNullString
ElseIf Mid$(string1, i, 1) = Mid$(string2, j, 1) Then
'equal characters, save it and then go up and left
backTraceLeft = backTraceLeft(c, string1, string2, i - 1, j - 1) & Mid$(string1, i, 1)
Else
'go in the direction of the highest number, defaulting to left
If (c(i, j - 1) >= c(i - 1, j)) Then
backTraceLeft = backTraceLeft(c, string1, string2, i, j - 1)
Else
backTraceLeft = backTraceLeft(c, string1, string2, i - 1, j)
End If
End If
End Function
'the following function returns a string with indication to what was deleted or added
'proceding character can be;
' = no change
' - deletion
' + addition
Public Function getDiff(ByRef c() As Long, ByRef stringOld As String, ByRef stringNew As String, ByRef i As Long, ByRef j As Long) As String
If i > 0 Then
If j > 0 Then 'both are greater than zero
'can only do the following comparison when i and j are greater than zero
If Mid$(stringOld, i, 1) = Mid$(stringNew, j, 1) Then
getDiff = getDiff(c, stringOld, stringNew, i - 1, j - 1) & Mid$(stringOld, i, 1) & "="
Else
If i = 0 Then
getDiff = getDiff(c, stringOld, stringNew, i, j - 1) & Mid$(stringNew, j, 1) & "+"
ElseIf c(i, j - 1) >= c(i - 1, j) Then
getDiff = getDiff(c, stringOld, stringNew, i, j - 1) & Mid$(stringNew, j, 1) & "+"
ElseIf j = 0 Then
getDiff = getDiff(c, stringOld, stringNew, i - 1, j) & Mid$(stringOld, i, 1) & "-"
ElseIf c(i, j - 1) < c(i - 1, j) Then
getDiff = getDiff(c, stringOld, stringNew, i - 1, j) & Mid$(stringOld, i, 1) & "-"
Else
getDiff = vbNullString
End If
End If
Else 'i is is greater than zero
If j = 0 Then
getDiff = getDiff(c, stringOld, stringNew, i - 1, j) & Mid$(stringOld, i, 1) & "-"
ElseIf c(i, j - 1) < c(i - 1, j) Then
getDiff = getDiff(c, stringOld, stringNew, i - 1, j) & Mid$(stringOld, i, 1) & "-"
Else
getDiff = vbNullString
End If
End If
Else
If j > 0 Then 'j is greater than zero
If i = 0 Then
getDiff = getDiff(c, stringOld, stringNew, i, j - 1) & Mid$(stringNew, j, 1) & "+"
ElseIf c(i, j - 1) >= c(i - 1, j) Then
getDiff = getDiff(c, stringOld, stringNew, i, j - 1) & Mid$(stringNew, j, 1) & "+"
Else
getDiff = vbNullString
End If
Else 'none are greater than zero
getDiff = vbNullString
End If
End If
End Function
'this function returns the location of the string difference
Public Function passGetDiffOutput(ByRef outputStr As String) As Long()
Dim i As Long
i = 1
Dim typeChr As String
Dim oldi As Long
Dim newi As Long
oldi = 0
newi = 0
Dim toFrom() As Long
Dim toFromCount As Long
toFromCount = -1
Dim typeChrPrev As String
typeChrPrev = vbNullString
Do While i < Len(outputStr)
typeChr = Mid$(outputStr, i + 1, 1)
Select Case typeChr
Case "="
If typeChr <> typeChrPrev Then
'check if it is comming from a deletion
If typeChrPrev = "-" Then
toFrom(2, toFromCount) = oldi
End If
'check if it is comming from a addition
If typeChrPrev = "+" Then
toFrom(2, toFromCount) = newi
End If
End If
oldi = oldi + 1 'update old index
newi = newi + 1 'update new index
Case "-"
'check if it is comming from a addition
If typeChrPrev = "+" Then
toFrom(2, toFromCount) = newi
End If
oldi = oldi + 1 'update old index
If typeChr <> typeChrPrev Then
toFromCount = toFromCount + 1
ReDim Preserve toFrom(2, toFromCount)
'let old be -1
toFrom(0, toFromCount) = -1
toFrom(1, toFromCount) = oldi
End If
Case "+"
'check if it is comming from a deletion
If typeChrPrev = "-" Then
toFrom(2, toFromCount) = oldi
End If
newi = newi + 1 'update new index
If typeChr <> typeChrPrev Then
toFromCount = toFromCount + 1
ReDim Preserve toFrom(2, toFromCount)
'let new be 1
toFrom(0, toFromCount) = 1
toFrom(1, toFromCount) = newi
End If
End Select
i = i + 2
typeChrPrev = typeChr
Loop
'check if it ended on a deletion or adition
If typeChrPrev = "-" Then
toFrom(2, toFromCount) = oldi
End If
If typeChrPrev = "+" Then
toFrom(2, toFromCount) = newi
End If
passGetDiffOutput = toFrom
End Function
'note, arrays must be single dimension
Public Function longestCommonSubsequenceArr(ByRef array1() As String, ByRef array2() As String) As Long()
On Error Resume Next
If UBound(array1, 2) > 0 Or UBound(array2, 2) > 0 Then 'multidimensional arrays
If Error = vbNullString Then
Exit Function
End If
End If
If UBound(array1) < 0 Or UBound(array2) < 0 Then 'check if arrays are bounded
If Error <> vbNullString Then
Exit Function
End If
End If
Dim num() As Long
'define the array, note rows of zeros get added to front automatically
ReDim num(UBound(array1) + 1, UBound(array2) + 1)
Dim i As Long, j As Long
'note, arrays must always start at indice zero.
For i = 0 To UBound(array1)
For j = 0 To UBound(array2)
If array1(i) = array2(j) Then
num(i + 1, j + 1) = num(i, j) + 1
Else
num(i + 1, j + 1) = max(num(i, j + 1), num(i + 1, j))
End If
Next j
Next i
longestCommonSubsequenceArr = num
End Function
Public Function stringToArray(ByRef str As String) As String()
Dim i As Long
Dim arr() As String
ReDim arr(Len(str) - 1)
For i = 1 To Len(str)
arr(i - 1) = Mid$(str, i, 1)
Next i
stringToArray = arr
End Function
Sub exampleArr()
Dim string1 As String
Dim string2 As String
string1 = "this is a find the haystack string"
string2 = "this is a replace the needle string"
Dim a1() As String
Dim a2() As String
a1 = stringToArray(string1)
a2 = stringToArray(string2)
Dim c() As Long
c = longestCommonSubsequenceArr(a1, a2)
Dim str() As String
str = backTraceUpArr(c, a1, a2, UBound(a1), UBound(a2))
Dim dif() As String
dif = getDiffArr(c, a1, a2, UBound(a1), UBound(a2))
End Sub
'back traces c, defaulting in the up direction
Public Function backTraceUpArr(ByRef c() As Long, ByRef array1() As String, ByRef array2() As String, ByRef i As Long, ByRef j As Long) As String()
Dim arr() As String
If i < 0 Or j < 0 Then
backTraceUpArr = arr
ElseIf array1(i) = array2(j) Then
'equal characters, save it and then go up and left
arr = backTraceUpArr(c, array1, array2, i - 1, j - 1)
'check the bounding of arr
Dim bound As Long
On Error Resume Next
bound = UBound(arr)
If Error <> vbNullString Then
ReDim arr(0)
arr(0) = array1(i)
Else 'no error
ReDim Preserve arr(bound + 1)
arr(bound + 1) = array1(i)
End If
backTraceUpArr = arr
Else
'go in the direction of the highest number, defaulting to up
If (c(i + 1, j) > c(i, j + 1)) Then
backTraceUpArr = backTraceUpArr(c, array1, array2, i, j - 1)
Else
backTraceUpArr = backTraceUpArr(c, array1, array2, i - 1, j)
End If
End If
End Function
'returns a 2xn array, where
'indice 0 are equal
'indice 1 are deletions
'indice 2 are additions
Public Function getDiffArr(ByRef c() As Long, ByRef arrayOld() As String, ByRef arrayNew() As String, ByRef i As Long, ByRef j As Long) As String()
Dim arr() As String
Dim bound As Long
On Error Resume Next
If i >= 0 Then
If j >= 0 Then 'both are greater or equal to zero
'can only do the following comparison when i and j are greater or equal than zero
If arrayOld(i) = arrayNew(j) Then
arr = getDiffArr(c, arrayOld, arrayNew, i - 1, j - 1)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(0, 0) = arrayOld(i)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(0, bound + 1) = arrayOld(i)
End If
getDiffArr = arr
Else
If i = 0 Then
arr = getDiffArr(c, arrayOld, arrayNew, i, j - 1)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(2, 0) = arrayNew(j)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(2, bound + 1) = arrayNew(j)
End If
getDiffArr = arr
ElseIf c(i + 1, j - 1 + 1) >= c(i - 1 + 1, j + 1) Then
arr = getDiffArr(c, arrayOld, arrayNew, i, j - 1)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(2, 0) = arrayNew(j)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(2, bound + 1) = arrayNew(j)
End If
getDiffArr = arr
ElseIf j = 0 Then
arr = getDiffArr(c, arrayOld, arrayNew, i - 1, j)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(1, 0) = arrayOld(i)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(1, bound + 1) = arrayOld(i)
End If
getDiffArr = arr
ElseIf c(i + 1, j - 1 + 1) < c(i - 1 + 1, j + 1) Then
arr = getDiffArr(c, arrayOld, arrayNew, i - 1, j)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(1, 0) = arrayOld(i)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(1, bound + 1) = arrayOld(i)
End If
getDiffArr = arr
Else
getDiffArr = arr
End If
End If
Else 'i is is greater or equal to zero
If j = 0 Then
arr = getDiffArr(c, arrayOld, arrayNew, i - 1, j)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(1, 0) = arrayOld(i)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(1, bound + 1) = arrayOld(i)
End If
getDiffArr = arr
ElseIf c(i + 1, j - 1 + 1) < c(i - 1 + 1, j + 1) Then
arr = getDiffArr(c, arrayOld, arrayNew, i - 1, j)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(1, 0) = arrayOld(i)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(1, bound + 1) = arrayOld(i)
End If
getDiffArr = arr
Else
getDiffArr = arr
End If
End If
Else
If j >= 0 Then 'j is greater than zero
If i = 0 Then
arr = getDiffArr(c, arrayOld, arrayNew, i - 1, j)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(2, 0) = arrayNew(j)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(2, bound + 1) = arrayNew(j)
End If
getDiffArr = arr
ElseIf c(i + 1, j - 1 + 1) >= c(i - 1 + 1, j + 1) Then
arr = getDiffArr(c, arrayOld, arrayNew, i, j - 1)
bound = UBound(arr, 2) 'check the bounding of arr
If Error <> vbNullString Then
Err.Clear
ReDim arr(2, 0)
arr(2, 0) = arrayNew(j)
Else 'no error
ReDim Preserve arr(2, bound + 1)
arr(2, bound + 1) = arrayNew(j)
End If
getDiffArr = arr
Else
getDiffArr = arr
End If
Else 'none are greater than zero
getDiffArr = arr
End If
End If
End Function
Okay, so this post is about 3 years too late, but I thought I would post it anyway.
I have a number of old laptops which I use as digital photo frames, we are talking original Pentiums II here. The problem is given the age of these, the hard drives are either extremely noisy and about to die, or already conked out. So what is a cheap reliable solution for these aged drives, a Compact Flash memory card and an IDE adapter.
I advise buying the dual models as it gives you four alternate ways to play with (two dual slots, and single jumper for selecting either master or slave). Two identical Toshiba laptops, would only accept these devices in a specific different configuration, perhaps it was the different adapter models though. A 4GB Compact Flash card can be purchased for $10, with the adapter around $2.
Below are two versions of the IDE to Compact Flash adapter;
And a cheapy Compact Flash card;
Okay, so the speed of these aren’t too great, but for what I am using them for they are perfect.
I recently went through the ordeal of changing the prefixes of the WordPress tables from the default wp_ to something more random, I have created the following to help anyone wanting to go through the same process.
Lets say you have some program ‘A’ that has no documentation and no help files but is being executed by some program ‘B’. You want to run program ‘A’ is individually, but you need to know what parameters/arguments are being passed from program ‘B’.
The following executable will help. Replace program ‘A’ (temporarily) with the following executable. Once program ‘B’ executes this new program, the parameters will be displayed in a message box.
Source code below;
Public Sub main()
Dim msg As String = vbNullString
Dim separators As String = " "
Dim commands As String = Microsoft.VisualBasic.Command()
Dim str() As String = commands.Split(separators.ToCharArray)
Dim i As Long
For i = 0 To UBound(str)
msg = msg & str(i).ToString & vbCr
Next
MsgBox(msg)
End Sub
I have recently upgraded the code to combine multiple RSS feeds, for the original version see this post.
To install, extract the following zip file to a directory where you want your combined feeds to be displayed, I use thydzik.com/combinedfeed as thydizk.com/feed is already used by WordPress.
Edit index.php for your site, and make sure the temp directory has write permissions (mod 755). That should be it. Enjoy.
thydzik RSS feed aggregator v2.zip
Thanks to Magpie RSS and Feedcreator.
<?php
$TMP_ROOT = "temp/"; //a atempory folder for storing the cached feeds, need to have write access (mod755)
$DOMAIN_NAME = "http://thydzik.com/";
$SITE_TITLE = "Travis Hydzik's blog feeds";
$SITE_DESRIPTION = "A collection of Travis Hydzik's blog feeds";
$SITE_AUTHOR = "Travis Hydzik";
$FEEDS_ARRAY = array( //the collection of urls linking to individual feeds
"http://hydzik.com/feed/",
"http://sonyaandtravis.com/feed",
"http://thydzik.com/feed/"
);
$MAX_ITEMS = 10;
$SHOW_FULL_FEED = FALSE;
//stop editing from here onwards
define('MAGPIE_DIR', '');
define('MAGPIE_CACHE_DIR', $TMP_ROOT);
//include magpie rss http://magpierss.sourceforge.net/
@require_once(MAGPIE_DIR.'rss_fetch.inc');
//include universal feed creator http://sourceforge.net/projects/feedcreator/
@include(MAGPIE_DIR.'feedcreator.class.php');
//create the basic rss feed
$rss = new UniversalFeedCreator();
$rss->useCached();
$rss->title = $SITE_TITLE;
$rss->description = $SITE_DESRIPTION;
$rss->link = $DOMAIN_NAME;
$rss->syndicationURL = curPageURL();
//get all items is all feeds
$total_temp = 0; //temp total number of posts in all rss feeds
foreach ($FEEDS_ARRAY as $single_url) {
$array_temp[$single_url]['page_title'] = url_grab_title($single_url); //grab the page title
$rss_temp = fetch_rss($single_url);
$items = array_slice($rss_temp->items, 0, $MAX_ITEMS);
$array_temp[$single_url]['rss_data'] = $items;
$total_temp += count($items);
$array_temp[$single_url]['rss_pointer'] = 0;
preg_match('@^(?:http://)?([^/]+)@i', $single_url, $matches);
$array_temp[$single_url]['site_url'] = $matches[0];
}
while ($total_temp <> 0 && $MAX_ITEMS > 0){// loop while there are remaining posts to process
$date_timestamp_temp = 0; //initialise to 0
foreach ($FEEDS_ARRAY as $single_url) {
$this_date_timestamp = $array_temp[$single_url]['rss_data'][$array_temp[$single_url]['rss_pointer']]['date_timestamp']; //get the date stamp of this post
if ($this_date_timestamp > $date_timestamp_temp) { //if this date stamp is the newest, save where it came from
$date_timestamp_temp = $this_date_timestamp; //update with this date stamp
$temp_url = $single_url; //save the url feed
$pointer_temp = $array_temp[$single_url]['rss_pointer']; //save the item number
}
}
$total_temp --; //decrement total remaining posts to process
$MAX_ITEMS --; //decrement number of posts to display
$array_temp[$temp_url]['rss_pointer'] ++; //increment post index of used post rss
//get the saved item
$item = $array_temp[$temp_url]['rss_data'][$pointer_temp];
//create the new item
$item_new = new FeedItem();
//add all the copied basics
$item_new->title = $item['title'];
$item_new->link = $item['link'];
$item_new->date = $item['pubdate'];
$item_new->author = $item['author'];
$item_new->source = $temp_url;
//to show full feed or blurb
if ($SHOW_FULL_FEED) {
$item_new->description = $item['content']['encoded'].'<p>Copyright © <a href="'.$array_temp[$temp_url]['site_url'].'">'.$array_temp[$temp_url]['page_title'].'</a>. All Rights Reserved.</p>';
} else {
$item_new->description = $item['description'] .'<p>Copyright © <a href="'.$array_temp[$temp_url]['site_url'].'">'.$array_temp[$temp_url]['page_title'].'</a>. All Rights Reserved.</p>';
}
$rss->addItem($item_new);
}
// a quick function the grab a pages title
function url_grab_title($rss_url) {
$contents = file_get_contents($rss_url, TRUE, NULL, 0, 3072);
$contents = preg_replace("/(\n|\r)/", '', $contents);
preg_match('/<title>(.*?)<\/title>/i', $contents, $matches);
return $matches[1];
}
//get page url (for syndication), source http://www.webcheatsheet.com/PHP/get_current_page_url.php
function curPageURL() {
$pageURL = 'http';
if ($_SERVER["HTTPS"] == "on") {$pageURL .= "s";}
$pageURL .= "://";
if ($_SERVER["SERVER_PORT"] != "80") {
$pageURL .= $_SERVER["SERVER_NAME"].":".$_SERVER["SERVER_PORT"].$_SERVER["REQUEST_URI"];
} else {
$pageURL .= $_SERVER["SERVER_NAME"].$_SERVER["REQUEST_URI"];
}
return $pageURL;
}
// get your news items from other feed and display back
$rss->saveFeed("RSS2.0", $TMP_ROOT."feed.xml");
?>
A quick guide to how to replace right-pointing double angle quotation marks (») (U+00BB) with bullets (•) (U+2022).
Edit the following style.css in the wp-content\themes\default folder;
.entry ul li:before, #sidebar ul ul li:before {
content: "\00BB \0020";
}
to;
.entry ul li:before, #sidebar ul ul li:before {
content: "\2022 \0020";
}
Recently, my Linux Go Daddy hosting servicing all three of my WordPress blogs were somehow accessed and malicious code inserted into every one of my php files.
The symptoms include;
What to look for;
<?php /**/ eval(base64_decode("aWYoZnVuY3Rpb25fZXhpc3RzKCdvYl...=="));?>
<iframe src="http://iss9w8s89xx.org/in.php" width=1 height=1 frameborder=0></iframe>
What to do;
Now to make things easier, I have created a VBS script that will automate the cleanup task. Place it in your local root director and run. A log file will be generated at C:\cleanUpWordPressPHP.txt listing the files it has cleaned.
Download the VBS script cleanUpWordPressPHP.vbs (right-click save-as)
Further information can be found on this Google support thread.
