[Okta Webinar] Learn how to a build a cloud-first strategyRegister Now

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 368
  • Last Modified:

Getting my executable name

I used to do VB6.GetEXEName() but .NET says I shouldn't use a reference to VB6. Any ideas how to get it? I tried this:

Dim exe As String = System.Reflection.Assembly.GetExecutingAssembly.GetName

But got:

D:\Class1.vb(18): Value of type 'System.Reflection.AssemblyName' cannot be converted to 'String'.
0
drakkarnoir
Asked:
drakkarnoir
  • 5
  • 4
  • 3
  • +2
2 Solutions
 
DJ_Back-QCommented:
Just you this.

Application.ExecutablePath

If you don't want the path, just use the string.substring to get your executable name.


You can also use Application.ProductName(), but you will first need to enter the product name into the AssemblyInfo.vb

Andre,
MCSD
0
 
natlozCommented:
Maybe try

SystemReflection.Assembly.GetExecutingAssembly.GetName.toString()
0
 
drakkarnoirAuthor Commented:
Argh, I wanted to edit my question to also include:

How do I see if a value exists in array? Is there a bool return function or key return? So that I can do:

If CBOOL(inarray("test",my_array)) Then
MsgBox("Found it!")
End If
0
Concerto's Cloud Advisory Services

Want to avoid the missteps to gaining all the benefits of the cloud? Learn more about the different assessment options from our Cloud Advisory team.

 
DJ_Back-QCommented:
I don't think there is such a thing in dot not for a normal array.

You should consider replacing your array by and ArrayList. The arraylist is much more efficient. It's collection based, and has a binary search with which you could locate you value.
0
 
drakkarnoirAuthor Commented:
Example code?
0
 
imu79Commented:
You should use a hashtable for lookups or searches.

Dim ohash as new Hashtable

with ohash
  .add("item1", "item1")
  .add("item2", "item3")
  .add("item3", "item3")
end with

if ohash.Contains("item1") then
  MessageBox.Show("Found !")
end if

Imran.
0
 
DJ_Back-QCommented:
       Dim myArray As New System.Collections.ArrayList

        myArray.Add("item1")
        myArray.Add("item2")
        myArray.Add("item3")

        myArray.Sort()

        If myArray.BinarySearch("item1") >= 0 Then
            MessageBox.Show("Fount it")
        End If

' BinarySearch returns the index of the occurence... so if it's less then 0, it hasn't find it. Also, because it's a BinarySearch, you must sort the list first. If not it will not work properly.
0
 
imu79Commented:
just for the record..
hashtables are much faster since it uses..well..hash tables for storing data. since a unique hashcode (for all practical purposes) is generate from the key for each item stored in the hashtable, searching for an element (the key) is very fast especially if the data structure is going to store a lot of elements.

while the worst case search time for a binary search is O(nLog(n)) that of a search operation in hashtable is O(n) where n is the number of elements in the data structure. In fact, for most practical purposes since the hashcode will be unique for each element in the hashtable, the search time is O(1) which is very fast compared to binary search.

Imran.
0
 
imu79Commented:
Oh and yes - you don't even need to sort the elements in the hashtable to do a fast search unlike the binarysearch in an arraylist or any other data structure.

Imran.
0
 
DJ_Back-QCommented:
imy79 that is true until one point. The bigger the hash table gets, the less efficient it is. There is a point after X number of items that the ArrayList will become faster and more efficient.

Andre
0
 
DJ_Back-QCommented:
Forgot to mention, actually whats behing the ArrayList is a hash table.
0
 
imu79Commented:
No - I believe its the opposite.

look at the bottom where speed of binary search is mentioned:
http://msdn.microsoft.com/library/default.asp?url=/library/en-us/cpref/html/frlrfSystemCollectionsArrayListClassBinarySearchTopic3.asp

look at the remarks section here for speed of search for the Contains( ) method:
http://msdn.microsoft.com/library/default.asp?url=/library/en-us/cpref/html/frlrfsystemcollectionshashtableclasscontainstopic.asp

The larger the number of elements, the higher the value of log(n) gets in which case O(log(n)) means its going to take longer to search for the binary search. On the other hand, the hashtable has an almost constant time for retrieving an element irrespective of the number of elements since it has a running time of O(1).

Imran.
0
 
SpanxxxCommented:
Barring you are referring to your array as a whole and not just an item in the array, here is the easy .Net way to check.

If array.length > 0 then
 'array is not empty
Else
 'array is empty
End If


and repeating the first comment, with a little more info
dim exeName as string
exeName = Application.ExecutablePath.Substring(Application.ExecutablePath.LastIndexOf("\") + 1)
0
 
drakkarnoirAuthor Commented:
Thanks to all :)
0

Featured Post

Vote for the Most Valuable Expert

It’s time to recognize experts that go above and beyond with helpful solutions and engagement on site. Choose from the top experts in the Hall of Fame or on the right rail of your favorite topic page. Look for the blue “Nominate” button on their profile to vote.

  • 5
  • 4
  • 3
  • +2
Tackle projects and never again get stuck behind a technical roadblock.
Join Now