Skip to main content

How to Add Menu Control: WPF

Any GUI window in our computer like Notepad, MS Word, browsers or even visual studio have its own menu bar. As compare to other controls Menu bar helps user to do the desired task in simple & easy way. Menu bar can be added as the Menu control in programming languages.



WPF menu control enables the user to organize elements in hierarchy view. To add a menu bar, you have to just drag-n-drop the Menu control from the toolbox or write following code in XAML:

<Menu/>

It may be our main menu with IsMainMenu property to true. Writing above line of code will show nothing in the window, till we don’t add any item in it. Item can be added using MenuItem class with Header property.

In the following lines of XAML code, I have add three items in the menu bar.
<Menu IsMainMenu="True">
<MenuItem Header="First"></MenuItem>
<MenuItem Header="Second"></MenuItem>
<MenuItem Header="Third"></MenuItem>
</Menu>

Just run the code and it will show a window containing a menu bar with three items:

Menu bar control in WPF

Now as in other windows, user presses the left Alt key and menu bar has been highlighted, keyboard shortcut cab also be used by using underscore before the character as in following code.
<Menu IsMainMenu="True">
<MenuItem Header="_First"></MenuItem>
<MenuItem Header="_Second"></MenuItem>
<MenuItem Header="_Third"></MenuItem>
</Menu>

Now it will be used by keyboard shortcut as in other windows. Run the project and press left alt key it will highlight the menu bar as in following image:

Highlighted menu bar control WPF

Comments

Popular posts from this blog

difference between structure and union in C Language

In c language article we will see the difference between union and structure. Both are the user define datatype in c language. See the table which is mentioned below: ASP.NET Video Tutorial Series Structure Union1.The keywordstruct is used to define a structure 1. The keyword union is used to define a union. 2. When a variable is associated with a structure, the compiler allocates the memory for each member. The size of structure is greater than or equal to the sum ofsizes of its members. The smaller members may end with unused slack bytes. 2. When a variable is associated with a union, thecompiler allocates thememory by considering the size of the largest memory. So, size of union is equal to the size of largest member. 3. Each member within a structure is assigned unique storage area of location. 3. Memory allocated is shared by individual members of union. 4. The address of each member will be in ascending order This indicates that memory for each member will start at different offset v…

Difference between Linear search and Binary Search in c language

SQL Video Channel : Download all SQL Video



Binary Search Linear Search Works only on sorted items. such as  1,2,3,4,5,6  etc
Works on sorted as well as unsorted items. 12,4,5,3,2,1 etc Very efficient if the items are sorted Very efficient if the items are less and present in the beginning of the list. such as Suppose your list items are : 12,3,4,5,1 and you want to search 12 number then you get beginning in the list. Works well with arrays and not on linked lists. Works with arrays and linked lists.
Number of comparisons are less More number of comparisons are required if the items are present in the later part of the array or its elements are more.

Memory representation of Linked List Data Structures in C Language

Memory representation of Linked List

             In memory the linked list is stored in scattered cells (locations).The memory for each node is allocated dynamically means as and when required. So the Linked List can increase as per the user wish and the size is not fixed, it can vary.

               Suppose first node of linked list is allocated with an address 1008. Its graphical representation looks like the figure shown below:


      Suppose next node is allocated at an address 506, so the list becomes,



  Suppose next node is allocated with an address with an address 10,s the list become,


The other way to represent the linked list is as shown below:




 In the above representation the data stored in the linked list is “INDIA”, the information part of each node contains one character. The external pointer root points to first node’s address 1005. The link part of the node containing information I contains 1007, the address of next node. The last node …