Tutorial by Examples: ar

Progress supports one dimensional arrays, but they are called EXTENTS. /* Define a character array with the length 5, and display it's length */ DEFINE VARIABLE a AS CHARACTER EXTENT 5 NO-UNDO. DISPLAY EXTENT(a). Individual positions i the array is accessed using "standard" c-style b...
array_add() This method is used to add new key value pairs to an array. $array = ['username' => 'testuser']; $array = array_add($array, 'age', 18); result ['username' => 'testuser', 'age' => 18]
Use browser.driver instead of driver Use browser.driver.ignoreSynchronization = true Reason: Protractor waits for angular components to load completely on a web-page befor it begins any execution. However, since our pages are non-angular, Protractor keeps waiting for 'angular' to load till the tes...
Before starting with deletion I just want to put some lights on what is a Binary search tree(BST), Each node in a BST can have maximum of two nodes(left and right child).The left sub-tree of a node has a key less than or equal to its parent node's key. The right sub-tree of a node has a key greater ...
Array Implementation #include<stdio.h> #define MAX 100000 //Global variables int top = -1; int a[MAX]; void push(int x){ if(top == MAX-1){ // Check whether stack is full printf("Stack Overflow\n"); retur...
From VBA array sort function? Public Sub QuickSort(vArray As Variant, inLow As Long, inHi As Long) Dim pivot As Variant Dim tmpSwap As Variant Dim tmpLow As Long Dim tmpHi As Long tmpLow = inLow tmpHi = inHi pivot = vArray((inLow + inHi) \ 2) While (tmpLow <=...
This code takes advantage of the Sort class in the Microsoft Excel Object Library. For further reading, see: Copy a range to a virtual range How to copy selected range into given array? Sub testExcelSort() Dim arr As Variant InitArray arr ExcelSort arr End Sub Private Su...
From anywhere in Vim, execute :help :help. This will open a horizontally split window with the manual page for the :help command. :help by itself will take you to the Table of Contents for the manual itself. Vim's help files are navigable like regular files (you can search for keywords within a fil...
:help [subject] attempts to find the "best" match for the argument you supply. The argument "can include wildcards like *, ? and [a-z] (any letter). You can additionally use Vim's command-line completion with CTRL+D: :help spli<Ctrl-D> will display a list of help topics matchi...
Queue follow FIFO as it is mentioned in the introduction. Five major operations: Enqueue(x): pushes x to the back of the queue. Dequeue(): pops an element from the front of the queue. isEmpty(): Finds whether the queue is empty or not. isFull(): Finds whether the queue is full or not. frontV...
Memory is efficiently organized in a circular queue as compared to linear queue. In Linear Queue: In Circular Queue: Remaining spaces can be used: Code for it to do the same: #include<stdio.h> #define MAX 10000 int front = -1; int rear = -1; int a[MAX]; bool isFull() { if...
For example if the input is: Output should be false: As 4 in the left sub-tree is greater than the root value(3) If the input is: Output should be true
struct tree{ int a; tree* right; tree* left; }; tree* root=NULL; void insert(tree*& in, int b){ if(in){ if(in->a<b) insert(in->right,b); else if(in->a>b) insert(in->left,b); ...
Setup ActiveMQ Download a ActiveMQ distribution from activemq.apache.org and unpack it somewhere You can start the server immediately, running unsecured on localhost, using the script bin/activemq When it is running, you can access your local server's console on http://localhost:8161/admin/ Co...
Consider the Binary Tree: Pre-order traversal(root) is traversing the node then left sub-tree of the node and then the right sub-tree of the node. So the pre-order traversal of above tree will be: 1 2 4 5 3 6 7 In-order traversal(root) is traversing the left sub-tree of the node then the node ...
You can pass parameters by Bundle: Bundle myBundle = new Bundle(); myBundle.putString(MY_KEY, myValue); Get the value in onCreateLoader: @Override public Loader<String> onCreateLoader(int id, final Bundle args) { final String myParam = args.getString(MY_KEY); ... }
For example if the inputs are: Example:1 a) b) Output should be true. Example:2 If the inputs are: a) b) Output should be false. Pseudo code for the same: boolean sameTree(node root1, node root2){ if(root1 == NULL && root2 == NULL) return true; if(root1 == NULL ...
The core data structure of Keras is a model, a way to organize layers. The main type of model is the Sequential model, a linear stack of layers. For more complex architectures, you should use the Keras functional API. Here's the Sequential model: from keras.models import Sequential model = Sequ...
Usually, an HTML form element submitted to PHP results in a single value. For example: <pre> <?php print_r($_POST);?> </pre> <form method="post"> <input type="hidden" name="foo" value="bar"/> <button type="su...
The idea is to measure a layout before and after each change and if there is a significant change you can be somewhat certain that its the softkeyboard. // A variable to hold the last content layout hight private int mLastContentHeight = 0; private ViewTreeObserver.OnGlobalLayoutListener keyboa...

Page 181 of 218