Skip to main content

Appian 18.3 New End User experiences.

The newest version is Appian 18.3.Released in Aug 2018.

  1. New Native Mobile UI. Some components were not available earlier. Eg: Multi Column in Card Layout which was released with 18.2 .
  2. New SAIL component “Document Viewer”, a!documentViewerField(). Its like a web browser viewer. Eg: PDF, images, txt, xml.
  3. Email and Mobile Notification, push Notifications for news and sites.
  4. New Site Page Width for Ultra Wide Screens. Page Layout Setting as Full rather than Wide.
  5. Margins on Layouts can be configured. Padding below a layout; marginBelow: {“NONE”, “STANDARD”}
  6. Custom Color for Box Layout.
  7. Shortcut for Date and Time.
    1. Goto Date Field. 
    2. Click Down Arrow. 
    3. Then Press “T” to pick current values. 
    4. To delete (delete /(fn+delete)) clears the values on windows and MAC respectively.   

Just a quick and very brief look on some of the features, will be adding more. For more detailed information with screen prints, below given Release notes link can be referred.


Sources: 
Appian Release Notes 
Appian Documentation
Appian Community
 
Labels:

Comments

Post a Comment

Popular posts from this blog

Solution Python QnA #1

Solution for Python QnA for November 14, 2018. # OUTPUT****************************************** >>> x = input () 12 >>> y = int ( input ( 'Please enter a number' )) Please enter a number45 >>> x + y Traceback (most recent call last): File "<stdin>" , line 1 , in < module > TypeError : must be str , not int >>> y + y 90 >>> x + x '1212' In this (x+y); addition of integer and string is not allowed. hence we get the TypeError.
Post a Comment
Read more

Picking the structure!!

Use of arrays, rather sorted arrays or a linked list is somewhat difficult because both have their pros and cons.  Arrays excel when we have to perform a binary search while it’s faster to add and remove elements from linked lists.  A tree is one structure where there is ONLY ONE path to reach to a node. This can be explained further as “Nodes cannot be in closed loop” . Also there is a hierarchical relationship of parent and child. The average complexity varies from logarithmic to linear time. Now coming further to a data structure BSTs aka Binary Search Trees . Points to be remembered here:- Maximum two children. Left child is smaller than parent. Right one is greater than parent. Traversals :-   In order Traversal Ascending Sort; left subtree + root+ right subtree. So the above tree will look like:  4, 12, 16, 25, 28, 32 Pre order Traversal Root + left subtree + right subtree recursively. Eg: 25, 12, 4, 16, 32, 28 Po...
Post a Comment
Read more

Swapping of variables

There are a couple of classical ways to do it. Let the variables be:- a = 5 b = 10 1. By using temporary variable "temp" (name as per your convenience). temp = a a = b b = temp 2. Without "temp" or any extra variable a = a + b   // 15 b = a - b   // b becomes 5 a = a - b   // a becomes 10 3. In Python like a Boss!! :D a, b = b, a
Post a Comment
Read more