Results for "Author: brian cidern"

Sort Arrays at lightning speeds! I guess you could say this is the sequal to the TurboSort routine I recently uploaded. One of the comments pointed out that the CopyMemory API was about as fast as VB could swap strings, but the sort algorythm (BubbleSort) was poor and that the QuickSort algorythm was much faster.After some searching on the mothership, I found out how the QuickSearch algorythm worked and viola, here it is. This truely is fast. Here are the tests results. My system is a P233 with 128MB of RAM. I generated an array of 10,000 rows. Each row contained 100 random characters ranging from A-Z. I performed three tests. Here are the times in milliseconds. BubbleSort QuickSort Test 1 131,195.3 398.438 Test 2 131,351.6 421.875 Test 3 130,882.8 390.625 Whew!

Shells an app, then waits for that app to close before it continues processing.

MS stipulates that OS Version Info must be obtained "correctly" in their Windows2000 Application Specifications. This is the way. It also uses api's to get the OS path, get the Windows Temp Dir and to generate a unique temp file name. This is a .BAS file with a Sub Main() so it should compile easily. It generates the info, writes to a temp file and launches notepad with the info. No forms. You can easily hash through it to pull out what you need.

Sort arrays much faster with a better string swapping routine! Wow, I couldn't believe all the rewrites of the same sorting routines in PSC. "Look at mine", "No, use mine", yadda, yadda, yadda. They all use the horribly slow: vTemp = String1 String1 = String2 String1 = vTemp Geezzzz - When you have to sort 30,000+ strings this is slllooooowwwwwww. Here's a solution. It uses the the same sorting routine (or choose your own), but implements a much faster swap routine using the CopyMemory() API. Now, instead of swapping strings, which in my case could be up to 9,000 characters, you are only swapping a 4 byte memory address. Rock On!!

Sort Arrays at lightning speeds! I guess you could say this is the sequal to the TurboSort routine I recently uploaded. One of the comments pointed out that the CopyMemory API was about as fast as VB could swap strings, but the sort algorythm (BubbleSort) was poor and that the QuickSort algorythm was much faster.After some searching on the mothership, I found out how the QuickSearch algorythm worked and viola, here it is. This truely is fast. Here are the tests results. My system is a P233 with 128MB of RAM. I generated an array of 10,000 rows. Each row contained 100 random characters ranging from A-Z. I performed three tests. Here are the times in milliseconds. BubbleSort QuickSort Test 1 131,195.3 398.438 Test 2 131,351.6 421.875 Test 3 130,882.8 390.625 Whew!

Shells an app, then waits for that app to close before it continues processing.

MS stipulates that OS Version Info must be obtained "correctly" in their Windows2000 Application Specifications. This is the way. It also uses api's to get the OS path, get the Windows Temp Dir and to generate a unique temp file name. This is a .BAS file with a Sub Main() so it should compile easily. It generates the info, writes to a temp file and launches notepad with the info. No forms. You can easily hash through it to pull out what you need.

Sort arrays much faster with a better string swapping routine! Wow, I couldn't believe all the rewrites of the same sorting routines in PSC. "Look at mine", "No, use mine", yadda, yadda, yadda. They all use the horribly slow: vTemp = String1 String1 = String2 String1 = vTemp Geezzzz - When you have to sort 30,000+ strings this is slllooooowwwwwww. Here's a solution. It uses the the same sorting routine (or choose your own), but implements a much faster swap routine using the CopyMemory() API. Now, instead of swapping strings, which in my case could be up to 9,000 characters, you are only swapping a 4 byte memory address. Rock On!!

Sort Arrays at lightning speeds! I guess you could say this is the sequal to the TurboSort routine I recently uploaded. One of the comments pointed out that the CopyMemory API was about as fast as VB could swap strings, but the sort algorythm (BubbleSort) was poor and that the QuickSort algorythm was much faster.After some searching on the mothership, I found out how the QuickSearch algorythm worked and viola, here it is. This truely is fast. Here are the tests results. My system is a P233 with 128MB of RAM. I generated an array of 10,000 rows. Each row contained 100 random characters ranging from A-Z. I performed three tests. Here are the times in milliseconds. BubbleSort QuickSort Test 1 131,195.3 398.438 Test 2 131,351.6 421.875 Test 3 130,882.8 390.625 Whew!

Shells an app, then waits for that app to close before it continues processing.

MS stipulates that OS Version Info must be obtained "correctly" in their Windows2000 Application Specifications. This is the way. It also uses api's to get the OS path, get the Windows Temp Dir and to generate a unique temp file name. This is a .BAS file with a Sub Main() so it should compile easily. It generates the info, writes to a temp file and launches notepad with the info. No forms. You can easily hash through it to pull out what you need.

Sort arrays much faster with a better string swapping routine! Wow, I couldn't believe all the rewrites of the same sorting routines in PSC. "Look at mine", "No, use mine", yadda, yadda, yadda. They all use the horribly slow: vTemp = String1 String1 = String2 String1 = vTemp Geezzzz - When you have to sort 30,000+ strings this is slllooooowwwwwww. Here's a solution. It uses the the same sorting routine (or choose your own), but implements a much faster swap routine using the CopyMemory() API. Now, instead of swapping strings, which in my case could be up to 9,000 characters, you are only swapping a 4 byte memory address. Rock On!!

Shells an app, then waits for that app to close before it continues processing.

MS stipulates that OS Version Info must be obtained "correctly" in their Windows2000 Application Specifications. This is the way. It also uses api's to get the OS path, get the Windows Temp Dir and to generate a unique temp file name. This is a .BAS file with a Sub Main() so it should compile easily. It generates the info, writes to a temp file and launches notepad with the info. No forms. You can easily hash through it to pull out what you need.

Sort arrays much faster with a better string swapping routine! Wow, I couldn't believe all the rewrites of the same sorting routines in PSC. "Look at mine", "No, use mine", yadda, yadda, yadda. They all use the horribly slow: vTemp = String1 String1 = String2 String1 = vTemp Geezzzz - When you have to sort 30,000+ strings this is slllooooowwwwwww. Here's a solution. It uses the the same sorting routine (or choose your own), but implements a much faster swap routine using the CopyMemory() API. Now, instead of swapping strings, which in my case could be up to 9,000 characters, you are only swapping a 4 byte memory address. Rock On!!

Sort Arrays at lightning speeds! I guess you could say this is the sequal to the TurboSort routine I recently uploaded. One of the comments pointed out that the CopyMemory API was about as fast as VB could swap strings, but the sort algorythm (BubbleSort) was poor and that the QuickSort algorythm was much faster.After some searching on the mothership, I found out how the QuickSearch algorythm worked and viola, here it is. This truely is fast. Here are the tests results. My system is a P233 with 128MB of RAM. I generated an array of 10,000 rows. Each row contained 100 random characters ranging from A-Z. I performed three tests. Here are the times in milliseconds. BubbleSort QuickSort Test 1 131,195.3 398.438 Test 2 131,351.6 421.875 Test 3 130,882.8 390.625 Whew!

Shells an app, then waits for that app to close before it continues processing.

MS stipulates that OS Version Info must be obtained "correctly" in their Windows2000 Application Specifications. This is the way. It also uses api's to get the OS path, get the Windows Temp Dir and to generate a unique temp file name. This is a .BAS file with a Sub Main() so it should compile easily. It generates the info, writes to a temp file and launches notepad with the info. No forms. You can easily hash through it to pull out what you need.

Sort Arrays at lightning speeds! I guess you could say this is the sequal to the TurboSort routine I recently uploaded. One of the comments pointed out that the CopyMemory API was about as fast as VB could swap strings, but the sort algorythm (BubbleSort) was poor and that the QuickSort algorythm was much faster.After some searching on the mothership, I found out how the QuickSearch algorythm worked and viola, here it is. This truely is fast. Here are the tests results. My system is a P233 with 128MB of RAM. I generated an array of 10,000 rows. Each row contained 100 random characters ranging from A-Z. I performed three tests. Here are the times in milliseconds. BubbleSort QuickSort Test 1 131,195.3 398.438 Test 2 131,351.6 421.875 Test 3 130,882.8 390.625 Whew!

Sort arrays much faster with a better string swapping routine! Wow, I couldn't believe all the rewrites of the same sorting routines in PSC. "Look at mine", "No, use mine", yadda, yadda, yadda. They all use the horribly slow: vTemp = String1 String1 = String2 String1 = vTemp Geezzzz - When you have to sort 30,000+ strings this is slllooooowwwwwww. Here's a solution. It uses the the same sorting routine (or choose your own), but implements a much faster swap routine using the CopyMemory() API. Now, instead of swapping strings, which in my case could be up to 9,000 characters, you are only swapping a 4 byte memory address. Rock On!!