Tutorial by Examples: c

It is common to use a background Thread for doing network operations or long running tasks, and then update the UI with the results when needed. This poses a problem, as only the main thread can update the UI. The solution is to use the runOnUiThread() method, as it allows you to initiate code exe...

On Mac OSX computers with MacPorts installed, open a terminal window and type: port list | grep scala This will list all the Scala-related packages available. To install one (in this example the 2.11 version of Scala): sudo port install scala2.11 (The 2.11 may change if you want to install a...

Once you have package control installed, it is super easy to install any plugin, theme, color scheme, syntax that you want! plugin: perform an action (compile your less code into css for example) theme: change the entire skin of sublime text (tabs, sidebar, command palette, etc) color scheme: c...

To get a shorter version of the Null or Empty check, use an "= Nothing" comparison. Iif(Fields!UserEmail.Value = Nothing, "Null or Empty", "Not Null or Empty") The "= Nothing" will check simultaneously against Null or Empty, giving a more compact expressio...

Public Function TableExists(value as String) as Boolean On Error Resume Next TableExists = Len(CurrentDb.Tabledefs(value).Name & "") > 0 End Function

To customize Sublime Text (including themes, syntax highlighting etc) you must have package control installed. To install package control visit www.packagecontrol.io/installation. Instead of following the above link, you can open the Sublime console to install it. The console is accessed via the c...

tkinter is a GUI toolkit that provides a wrapper around the Tk/Tcl GUI library and is included with Python. The following code creates a new window using tkinter and places some text in the window body. Note: In Python 2, the capitalization may be slightly different, see Remarks section below. ...

Often when using a callback you want access to a specific context. function SomeClass(msg, elem) { this.msg = msg; elem.addEventListener('click', function() { console.log(this.msg); // <= will fail because "this" is undefined }); } var s = new SomeClass("hello&q...

$user = wp_get_current_user(); foreach($user->data as $key=>$user_data){ if($key == 'user_pass' || $key == 'user_activation_key' || $key=='user_status'){} else{ $nice_key = ucfirst(str_replace('_', ' ', $key)); if($key == 'user_registered'){ $u...

Maximum subarray problem is the method to find the contiguous subarray within a one-dimensional array of numbers which has the largest sum. The problem was originally proposed by Ulf Grenander of Brown University in 1977, as a simplified model for maximum likelihood estimation of patterns in digiti...

public class MaximumSubarray { private static int Max(int a, int b) { return a > b ? a : b; } static int MaxSubArray(int[] input, int n) { int max = input[0]; int currentMax = input[0]; for (int i = 1; i < n; i++) { ...

Use Update the object name which is stored in reference SYNOPSIS git update-ref [-m <reason>] (-d <ref> [<oldvalue>] | [--no-deref] [--create-reflog] <ref> <newvalue> [<oldvalue>] | --stdin [-z]) General Syntax Dereferencing the symbolic refs, update th...

(input) output = 0 for cycleStart from 0 to length(array) - 2 item = array[cycleStart] pos = cycleStart for i from cycleStart + 1 to length(array) - 1 if array[i] < item: pos += 1 if pos == cycleStart: continue while item == array[pos]: ...

public class CycleSort { public static void SortCycle(int[] input) { for (var i = 0; i < input.Length; i++) { var item = input[i]; var position = i; do { var k = input.Where((t, j) => position != ...

The [record][1] library provides the ability to create compound terms with named fields. The directive :- record/1 <spec> compiles to a collection of predicates that initialize, set and get fields in the term defined by <spec>. For example, we can define a point data structure with nam...

01 some-string PIC X(32). ... MOVE " a string literal" TO some-string DISPLAY ":" some-string ":" DISPLAY ":" FUNCTION TRIM(some-string) ":" DISPLAY ":" FUNCTION TRIM(some-string LEADING) ":" DISPLAY ":" F...

Constraints: Input (an array to be sorted) Number of element in input (n) Keys in the range of 0..k-1 (k) Count (an array of number) Pseudocode: for x in input: count[key(x)] += 1 total = 0 for i in range(k): oldCount = count[i] count[i] = total total += oldCount for...

public class CountingSort { public static void SortCounting(int[] input, int min, int max) { var count = new int[max - min + 1]; var z = 0; for (var i = 0; i < count.Length; i++) count[i] = 0; foreach (int i in input) co...

035700 PROCEDURE DIVISION. 035800 035900 DECLARATIVES. 036000 036100 DEPT-HEAD-USE SECTION. USE BEFORE REPORTING DEPT-HEAD. 036200 DEPT-HEAD-PROC. 036300 SET DE-IX TO +1. 036400 SEARCH DEPARTMENT-ENTRY 036500 WHEN DE-NUMBER (DE-IX) = PRR-DEPARTMENT-NUMBER 036600 ...

public class HeapSort { public static void Heapify(int[] input, int n, int i) { int largest = i; int l = i + 1; int r = i + 2; if (l < n && input[l] > input[largest]) largest = l; if (r < n && input[r] ...