Skip to main content

Performing Conditional Formatting in XML

Conditional formatting refers to the formatting of data based on a specified criteria or condition . For example, while creating a list of famous sportsmen, you might want the names of the sportsmen who play your favorite sport to appear in red. You can specify this condition in your XML document using XSL Transformations (XSLT).

The two XSLT elements that you can use to specify conditions for formatting XML
Documents are:

  1. The if element
  2. The choose element

The if Element

The XSLT if element provides a simple if-then construct. The syntax of the if element
<xsl : if test = “condition”>
[ actions to be performed if the condition is true ]
</xsl : if >

In the preceding syntax, the test attribute specifies the criteria for performing the specified action, and condition specifies a Boolean expression that evaluates to true or false. For  example, to display the names of products priced higher than $100, you can use the following code:

<xsl : if test =”PRICE[ . &gt ; 100]”>
<xsl : value-of select=”PRODUCTNAME” />
</xsl : if>

The choose Element

The choose element enables you to choose from two or more possible courses of action. It enables you to test multiple conditions.
The  choose element must contain one or more when elements. It can contain only one optional otherwise element, which must appear after all the when elements. A choose element with only one when element behaves similar to the if element. With two or more choices, the choose element behaves like an if-then-else or switch-case construct. 
The syntax of the choose element is:
<xsl : choose>
      <xsl : when test=”condition”>
      [action to be taken]
      </xsl : when>
       <xsl : otherwise>
        [action to be taken]
        </xsl : otherwise>
</xsl : choose>

Identifying Comparison and Boolean Operators

The choose and if elements can be used with comparison and Boolean operators to narrow down the conditions based on which the XML document is formatted. The following  table lists the various comparison and Boolean operators.
Equal to
PRICE [ . = 20]
PRODUCTNAME [ . = ‘Mini Bus’]
Not equal to
PRICE [ .  != 20]
PRODUCTNAME [ . != ‘Barbie Doll’ ]
&lt ;
Less than
PRICE [ . &lt ; 20]
&gt ;
Greater than
PRICE [ . &gt ; 20]
&lt ;=
Less than or equal to
PRICE [ . &lt ; = 20]
&gt ;=
Greater than or equal to
PRICE [ . &gt ; = 20]
Logical AND
PRICE [ . &gt 20 and . &lt ; 30]
Logical OR
PRICE [ . = 20 or . = 45]
Negation operator
PRICE [not ( . =30) ]


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 …