Tutorial by Examples: s

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...

You can create classes without names that are not installed in the system by sending newAnonymousSubclass to a class. For example anonymousSet := Set newAnonymousSubclass will assign an anonymous subclass of Set to anonymousSet variable. Then you can compile methods in this class and instantiat...

var s = "Hello"; // The string referenced by variable 's' is normally immutable, but // since it is memory, we could change it if we can access it in an // unsafe way. unsafe // allows writing to memory; methods on Syste...

var scene = new THREE.Scene(); var camera = new THREE.PerspectiveCamera(75, window.innerWidth / window.innerHeight, 0.1, 50); camera.position.z = 25; var renderer = new THREE.WebGLRenderer(); renderer.setSize(window.innerWidth, window.innerHeight); document.body.appendChild(renderer.domElemen...

String bucketName = "bucket"; List<String> nodes = Arrays.asList("node1","node2"); // IP or hostname of one or more nodes in the cluster Cluster cluster = CouchbaseCluster.create(nodes); Bucket bucket = cluster.openBucket(bucketName); //check for a documen...

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...

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

Linked list representation is more efficient in terms of memory managerment. Code to show enqueue and deque in a Queue using Linklist in O(1) time. #include<stdio.h> #include<malloc.h> struct node{ int data; node* next; }; node* front = NULL; node* rear = NULL; vo...

Detailed instructions on getting gstreamer set up or installed.

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); ...

with Ada.Text_IO; procedure Image_And_Value is type Fruit is (Banana, Orange, Pear); X : Fruit := Orange; begin Ada.Text_IO.Put_Line (Boolean'Image (Fruit'Value (Fruit'Image (X)) = X and Fruit'Image (Fruit'Value ("ORANGE")) = "ORANGE"));...

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...

Android Apps are written in Java. The Android SDK tools compile the code, data and resource files into an APK (Android package). Generally, one APK file contains all the content of the app. Each app runs on its own virtual machine(VM) so that app can run isolated from other apps. Android system wor...

If you would like to get base project with methods described below you can download Xamarin.Android application template from my GitHub. You can find examples for: Application lifecycle methods Activity lifecycle methods Fragment lifecycle methods https://github.com/Daniel-Krzyczkowski/Xamar...

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 ...

For example if the given tree is: Level order traversal will be 1 2 3 4 5 6 7 Printing node data level by level. Code: #include<iostream> #include<queue> #include<malloc.h> using namespace std; struct node{ int data; node *left; node *right; }; ...

Glass.Mapper.Sc allows you to move your data from Sitecore and into your code seamlessly using strongly typed objects. The framework allows you to map data on to c# classes and interfaces without any additional mark-up. As the data is mapped to your target objects it is converted to the target type...

// Create a new read-only List<String> val list = listOf("Item 1", "Item 2", "Item 3") println(list) // prints "[Item 1, Item 2, Item 3]"