Skip to main content

HTML server control classes in ASP.NET

ASP.NET uses the HTML server control classes to work with the HTML controls using a programming language. These classes include the HtmlTextArea class for the HTML <textarea> controls, the HtmlInputButton class for HTML buttons created with the <input type="button"> elements, the HtmlInputText class for HTML text fields created with the <input type="text"> elements, and the rest. while working with HTML server control, you are actually working with their supporting classes. You can even work with these classes directly in code.
Most of the attributes of HTML server controls can be specified through the properties window of IDE. These properties are written in lowercase. As soon as you change or specify the value of these properties, the corresponding changes are made to the HTML element in the .aspx page. For example, you can set the caption of an HTML server button at design-time using the Value property, which corresponds to the HTML <Input> element's value attribute. However, at runtime, this attribute is supported by the HtmlInputButton class's Value property. When we work with an object of the HtmlInputButton class on the server, the casing (upper or lower case) of property name in server code adheres to the coding language standard.
It is important to know that the HTML server control classes exactly correspond to the actual HTML controls that you see in the HTML tab in ToolBox. For example, the HtmlInputButton class is used not just for buttons but also for reset buttons. All these buttons are created using an HTML <input> element, and they differ only through the attribute named type; for example, a standard button uses <input type="button">, a reset button uses <input type="reset">, and a submit button uses <input type="submit">.

Note : As per HTML rules, the HTML controls must be in the HTML form(with .htm or .html extension) while they are sent back to the server. However, when you create a web form using the ASP.NET IDE, you need not require to create the HTML form explicitly; ASP.NET does that automatically as soon as you add a new web form to the website.

HTML classes are based on the HtmlControl class. Some server control class are listed in

HtmlAnchor : Creates an <a> element for navigation.

HtmlButton : Creates an HTML button using the <button> element.

HtmlForm : Allows access to the <form> HTML element which is a container for other controls on a web page.

HtmlgenericControl : Defines the methods, properties and events for all HTML server controls not represented by .NET Framework.

HtmlImage : Maps the <img> element for displaying image on a web page.

HtmlInputButton : Creates an Html button using the <input> element.

HtmlInputCheckBox : Creates an Html checkbox.

HtmlInputControl : Defines the methods, properties and events for HTML input controls.

HtmlInputFile : Creates an HTML file upload control.

HtmlInputHidden : Creates an HTML input hidden control.

HtmlInputImage : Creates an HTML button that display image.

HtmlInputRadioButton : Creates an HTML radio button.

HtmlInputText : Creates an HTML text field. You can also use this control to create password fields.

HtmlSelect : Maps <select> element and allow to create list control.

HtmlTable : Creates an HTML table.

HtmlTableCell : Creates an HTML cell in a Table.


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 …