Tutorial by Examples: c

inline int add(int x, int y) { return x + y; } int main() { int a = 1, b = 2; int c = add(a, b); } In the above code, when add is inlined, the resulting code would become something like this int main() { int a = 1, b = 2; int c = a + b; } The inline function ...

I need to query all the details from virtual machine and update into the MongoDB. Which require the output look like this. { "_id" : ObjectId("5800509f23888a12bccf2347"), "ResourceGrp" : "XYZZ-MachineGrp", "ProcessTime" : ISODate(&q...

A* (A star) is a search algorithm that is used for finding path from one node to another. So it can be compared with Breadth First Search, or Dijkstra’s algorithm, or Depth First Search, or Best First Search. A* algorithm is widely used in graph search for being better in efficiency and accuracy, wh...

XML <Deborah> <address>Dark world</address> <master>Babadi</master> <ID>#0</ID> <colour>red</colour> <side>evil</side> </Deborah> XPATH boolean(/Deborah/master/text()) OR string(/Deborah/master...

XML <Dobby> <address>Hogwartz</address> <master></master> <colour>wheatish</colour> <side>all good</side> </Dobby> XPATH boolean(/Dobby/master/text()) OR string(/Dobby/master) != '' OUTPUT false

The Angular CLI command-line interface has AoT compilation support since beta 17. To build your app with AoT compilation, simply run: ng build --prod --aot

Whitelisting won't disable the doze mode for your app, but you can do that by using network and hold-wake locks. Whitelisting an Android application programmatically can be done as follows: boolean isIgnoringBatteryOptimizations = pm.isIgnoringBatteryOptimizations(getPackageName()); if(!isIgnorin...

here you can find the functions. With the table wf_example created in previous example, run: select i , dense_rank() over (order by i) , row_number() over () , rank() over (order by i) from wf_example The result is: i | dense_rank | row_number | rank ---+------------+------------+-...

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

When you compiled and loaded the code in the three examples before (ODEs in compiled languages - definition in R, ODEs in compiled languages - definition in C and ODEs in compiled languages - definition in fortran) you are able to run a benchmark test. library(microbenchmark) R <- function(){...

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

MailMessage represents mail message which can be sent further using SmtpClient class. Several attachments (files) can be added to mail message. using System.Net.Mail; using(MailMessage myMail = new MailMessage()) { Attachment attachment = new Attachment(path); myMail.Attachments.Add...

In WSO2 registry is a content store and a metadata repository. In WSO2 products and particularly WSO2 ESB uses registry to store metadata, artifacts (WSDL, XSD etc.,) and other service configurations like endpoints, sequences etc., Registry in WSO2 ESB has three flavours. Local registry Config...

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

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

Matrices are essentially two-dimensional arrays. That means that it associates (i, j) coordinates, where i is the row and j is the column, to a value. So, you could have : m3, 4 = "Hello" The easiest implementation is to make an array or arrays. In python, that would go as follows. ma...

This is a basic tslint.json setup which prevents use of any requires curly braces for if/else/for/do/while statements requires double quotes (") to be used for strings { "rules": { "no-any": true, "curly": true, "quotema...