Tutorial by Examples: is

It is also possible to assign a supervision strategy to these actors with the following: superviseWith(OneForOneStrategy() { case e: Exception if e.getMessage == "hello" ⇒ Stop case _: Exception ⇒ Resume })

Open Control Panel -> Programs and Features, choose the Visual Studio 2015 item, and then choose the Change button. In the setup wizard for Visual Studio, choose the Modify button. In the list of optional features to install, select the HTML/JavaScript (Apache Cordova) checkbox, c...

In Visual Studio, choose Tools->Extensions and Updates. In the Updates tab of the Extensions and Updates dialog box, choose Product Updates. If an update for Visual Studio Tools for Apache appears, select it, and then choose the Update button.

Hibernate (and embedded H2 DB) <?xml version="1.0" encoding="UTF-8"?> <persistence xmlns="http://java.sun.com/xml/ns/persistence" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://java.sun.com/...

var a:Number=0.123456789; trace(a); // 0.123456789 trace(a.toPrecision(4)); // 0.1235 trace(a.toFixed(4)); // 0.1235 trace(a.toExponential(4)); // 1.2345e-1 trace(a.toString(16)); // 0 - works for integer part only var b:Number=12345678.9876543; // a bigg...

Python 2.x2.3 x = 'hello world!' vowels = [x for x in 'AEIOU'] print (vowels) # Out: ['A', 'E', 'I', 'O', 'U'] print(x) # Out: 'U' Python 3.x3.0 x = 'hello world!' vowels = [x for x in 'AEIOU'] print (vowels) # Out: ['A', 'E', 'I', 'O', 'U'] print(x) # Out: 'hello world!' ...

Lists are a special kind of compound term. Lists are defined inductively: the atom [] is a list, denoting the empty list. if Ls is a list, then the term '.'(L, Ls) is also a list. There is a special syntax for denoting lists conveniently in Prolog: The list '.'(a, '.'(b, '.'(c, []))) can a...

In all serious Prolog systems, association lists are available to allow faster than linear access to a collection of elements. These association lists are typically based on balanced trees like AVL trees. There is a public domain library called library(assoc) that ships with many Prolog systems and ...

Consider the following block of code. try { using (var disposable = new MyDisposable()) { throw new Exception("Couldn't perform operation."); } } catch (Exception ex) { Console.WriteLine(ex.Message); } class MyDisposable : IDisposable { public vo...

maplist/2 and maplist/3 are higher-order predicates, which allow the definition of a predicate to be lifted about a single element to lists of such elements. These predicates can be defined using call/2 and call/3 as building blocks and ship with many Prolog systems. For example: ?- maplist(dif(a)...

defmodule Math do # We start of by passing the sum/1 function a list of numbers. def sum(numbers) do do_sum(numbers, 0) end # Recurse over the list when it contains at least one element. # We break the list up into two parts: # head: the first element of the list # ta...

In C# 5.0 and earlier the developer could only suppress warnings by number. With the introduction of Roslyn Analyzers, C# needs a way to disable warnings issued from specific libraries. With C# 6.0 the pragma directive can suppress warnings by name. Before: #pragma warning disable 0501 C# 6.0: ...

To get version 5394 use: svn co --revision r5394 https://svn.example.com/svn/MyRepo/MyProject/trunk Or the shorter version: svn co -r 5394 https://svn.example.com/svn/MyRepo/MyProject/trunk Or by using pegged revisions: svn co https://svn.example.com/svn/MyRepo/MyProject/trunk@5394 If al...

The type constructor for lists in the Haskell Prelude is []. The type declaration for a list holding values of type Int is written as follows: xs :: [Int] -- or equivalently, but less conveniently, xs :: [] Int Lists in Haskell are homogeneous sequences, which is to say that all elements mus...

To process lists, we can simply pattern match on the constructors of the list type: listSum :: [Int] -> Int listSum [] = 0 listSum (x:xs) = x + listSum xs We can match more values by specifying a more elaborate pattern: sumTwoPer :: [Int] -> Int sumTwoPer [] = 0 sumTwoPer (x1...

Access the nth element of a list (zero-based): list = [1 .. 10] firstElement = list !! 0 -- 1 Note that !! is a partial function, so certain inputs produce errors: list !! (-1) -- *** Exception: Prelude.!!: negative index list !! 1000 -- *** Exception: Prelude.!!: inde...

Recursion can be defined as: A method that calls itself until a specific condition is met. An excellent and simple example of recursion is a method that will get the factorial of a given number: public int Factorial(int number) { return number == 0 ? 1 : n * Factorial(number - 1); } ...

Add this permission to the manifest file to use Bluetooth features in your application: <uses-permission android:name="android.permission.BLUETOOTH" /> If you need to initiate device discovery or manipulate Bluetooth settings, you also need to add this permission: <uses-permi...

private static final int REQUEST_ENABLE_BT = 1; // Unique request code BluetoothAdapter mBluetoothAdapter; // ... if (!mBluetoothAdapter.isEnabled()) { Intent enableBtIntent = new Intent(BluetoothAdapter.ACTION_REQUEST_ENABLE); startActivityForResult(enableBtIntent, REQUEST_ENABLE_B...

private static final int REQUEST_DISCOVERABLE_BT = 2; // Unique request code private static final int DISCOVERABLE_DURATION = 120; // Discoverable duration time in seconds // 0 means always discoverable ...