Customized af:quickQuery component

Jdeveloper version – 11.1.2.2, Schema – HR
The default support of af:quickQuery component is very rich. It would list all the selected searchable columns of the View Object in one selectOneChoice list and adjacent to it another selectOneChpice list displaying various operators and one input text box for input to be searched .Here the search gets restricted to one column. There would be use cases where the search is combination of multiple columns which can be supported by customizing this component.  Fro the sake of an example take the following use case dependent on Employees table of HR schema -
“Display the list of all the employees with first name is “David”  and they had joined the organization  with last 5 years.”
In order to solve the above use case, in criteriaItems facet of quickQuery component add a selectOneChoice component and one inputTextbox component , see the code below -
<f:facet name="criteriaItems">
  <af:panelGroupLayout id="g1" layout="horizontal">
    <af:selectOneChoice label="Hired "
            valueChangeListener="#{backingBeanScope.backing_allEmployees.valueChnageListener}"
                                       id="soc2"
                                  value="#{backingBeanScope.backing_allEmployees.selectedHireDateTimeWindow}">
      <f:selectItems id="si2" value="#{backingBeanScope.backing_allEmployees.hireDates}"/>
    </af:selectOneChoice>
    <af:spacer width="10" height="10" id="s2" />
    <af:inputText label="Employee Name" id="it3"
                  binding="#{backingBeanScope.backing_allEmployees.empName}">
    </af:inputText>
  </af:panelGroupLayout>
</f:facet>

<af:inputText label="Label 1" id="it2" rendered="false"/>
Table 1
The UI would look something like this -
customized_quick_query_component

There are two problems with this solution -
1.) The search button in the UI ( the arrow image) is not aligned with the other two fields.
2.) The input box, the last line in table 1,  is not rendered.  this is a hack to make sure that the quickQuery component doesn’t render a read only component.
The code of the project can be found here


Technorati Tags: ,

Comments

Post a Comment

Popular posts from this blog

Palindrome program in Java using BufferedReader

import java.io.*; class Test { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.print("\nEnter a String : "); String str = br.readLine(); String rev = ""; int n = str.length(); for(int i=n-1 ; i>=0 ; i--) { rev = rev + str.charAt(i); } if(str.equals(rev)) System.out.println("\nGiven string is a palindrome"); else System.out.println("\nGiven string is not a palindrome"); } } Output 1 Enter a String : ABCDDCBA Given string is a palindrome Output 2 Enter a String : abcdabcd Given string is not a palindrome
Read more
Generics Array Java does not permit the construction of generic array. Suppose, for example, that we want to design a class that has an array field public class Table<AnyType> { private AnyType[] contents = new AnyType[5]; ... } It's hard to understand, but this is illegal! A workaround is to construct an array of objects with a type-cast: public class Table<AnyType> { private AnyType[] stack = (AnyType[]) new Object[5]; ... } source - http://www.cs.cmu.edu/~adamchik/15-121/lectures/Collections/collections.html
Read more

OOPS: Decomposition and Abstraction

When we write a a program and if the the code is expected to be less than few hundred of lines then we can afford to write a monolithic program but if the number of lines increase it becomes difficult  to maintain that program or adding new features to that program.  so how to handle this ? In order to write a program for a problem , the problem should be broken into multiple smaller problems and then each smaller problem should be solved  and make sure that solving all such smaller problem solves the actual , bigger problem. the process of breaking a problem into multiple smaller problem efficiently involves Decomposition and Abstraction. Definitions Decomposition- How to decompose large programming problems into small ones is called decomposition Abstraction - Abstraction is a way to do decomposition productively by changing the level of detail to be considered. In each iteration the irrelevant information can be removed. The process of abstraction can be seen as an app...
Read more