Tutorial by Examples: io

From android 6.0 this permission needs to grant dynamically, <uses-permission android:name="android.permission.SYSTEM_ALERT_WINDOW"/> Throwing below permission denied error on 6.0, Caused by: android.view.WindowManager$BadTokenException: Unable to add window android.view.ViewRoo...
library(deSolve) ## ----------------------------------------------------------------------------- ## Define parameters and variables ## ----------------------------------------------------------------------------- eps <- 0.01; M <- 10 k <- M * eps^2/2 L <- 1 L0 <- 0.5 ...
sink("caraxis_C.c") cat(" /* suitable names for parameters and state variables */ #include <R.h> #include <math.h> static double parms[8]; #define eps parms[0] #define m parms[1] #define k parms[2] #define L parms[3] #define L0 parms[4] #define r p...
sink("caraxis_fortran.f") cat(" c---------------------------------------------------------------- c Initialiser for parameter common block c---------------------------------------------------------------- subroutine init_fortran(daeparms) external daeparms ...
// Cancel older notification with same id, NotificationManager notificationMgr = (NotificationManager)context.getSystemService(Context.NOTIFICATION_SERVICE); notificationMgr.cancel(CALL_NOTIFY_ID);// any constant value // Create Pending Intent, Intent notificationIntent = null; PendingInt...
'use strict'; const Hapi = require('hapi'); const Joi = require('joi'); // Create a server with a host and port const server = new Hapi.Server(); server.connection({ host: 'localhost', port: 8000 }); /** * Add a route path with url param */ server.route({ method...
Shell sort, also known as the diminishing increment sort, is one of the oldest sorting algorithms, named after its inventor Donald. L. Shell (1959). It is fast, easy to understand and easy to implement. However, its complexity analysis is a little more sophisticated. The idea of Shell sort is the f...
public class ShellSort { static void SortShell(int[] input, int n) { var inc = 3; while (inc > 0) { int i; for (i = 0; i < n; i++) { var j = i; var temp = input[i]; w...
Given a class SomeClass, let's see how the TypeScript is transpiled into JavaScript. TypeScript source class SomeClass { public static SomeStaticValue: string = "hello"; public someMemberValue: number = 15; private somePrivateValue: boolean = false; constructor ()...
Rabin-Karp Algorithm is a string searching algorithm created by Richard M. Karp and Michael O. Rabin that uses hashing to find any one of a set of pattern strings in a text. A substring of a string is another string that occurs in. For example, ver is a substring of stackoverflow. Not to be confuse...
REPLACE ==magic-number== BY ==65535==.
When used in an expression out << setprecision(n) or in >> setprecision(n), sets the precision parameter of the stream out or in to exactly n. Parameter of this function is integer, which is new value for precision. Example: #include <iostream> #include <iomanip> #include...
When used in an expression out << setiosflags(mask) or in >> setiosflags(mask), sets all format flags of the stream out or in as specified by the mask. List of all std::ios_base::fmtflags : dec - use decimal base for integer I/O oct - use octal base for integer I/O hex - use hexade...
Installation: In order to use DataProviders, you need junit-dataprovider .jar : Github Direct download Hamcrest-core-1.3.jar : Github Direct download And add both of this .jar to your project. Usage: Add this import to your code: import com.tngtech.java.junit.dataprovider.DataProvider; im...
Detailed instructions on getting operating-system set up or installed.
Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more c...
I used C# language to implement Selection sort algorithm. public class SelectionSort { private static void SortSelection(int[] input, int n) { for (int i = 0; i < n - 1; i++) { var minId = i; int j; for (j = i + 1; j < n; j++...
A gen_server is a specific finite state machine working like a server. gen_server can handle different type of event: synchronous request with handle_call asynchronous request with handle_cast other message (not defined in OTP specification) with handle_info Synchronous and asynchronous mess...
Cryptography is the science of using mathematical constructs (codes) to make communication secure. The field of cryptography is a subset of the field of Information Security. There are many cryptographic operations possible; some best known examples are: Encryption : transforming a plaintext mes...
Detailed instructions on getting mono set up or installed.

Page 231 of 322