Skip to main content

Ways to Use Button Control: WPF

Button, a simple and small name to listen in all the programming languages. All the windows, forms, dialog boxes and even user controls mostly use this button to be performed some action. Open, close, submitting a form and whatever to do can also be performed by button.

Button control is of content control type, means it have a content property to be assigned by us. The content may be a string or anything that can be used under the conditions.

<Button Name=”loginButton” Content=”Click to Login”></Button>

The above button will look like a standard button control and saying the user to click if he/she want to login. Actually, it only have its content property, doesn’t have defined any action to be performed when user will click. So click event have to be defined to perform an action when user click on it.

<Button Name="loginButton" Content="Click to Login" Click="loginButton_Click"></Button>

In the code behind file the click event is generated like the following code in C# language
private void loginButton_Click(object sender, RoutedEventArgs e)
MessageBox.Show("You are logged in");
The message box is not pre-defined. When user click on the button it will show the above message each time. We can bind our button to the commands defined in a class to be performed the same action as in click event. The following code is used to bind a button to a command.

<Button Name="loginButton" Content="Click to Login" Command="{Binding ClickCommand}"></Button>

The command can be simply defined as the below code in C# language:
public ICommand ClickCommand
return showDetailCommand;
ICommand is the interface that is used for this command binding. We will learn it later. We can use a button as per our requirements using its properties.


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 …