Tutorial by Examples: g

First, install fs and path in your project npm install --save fs path Add the following code to your app.js file: var express = require('express') var fs = require('fs') var morgan = require('morgan') var path = require('path') var app = express() // create a write stream (in append mo...
First, install fs, file-stream-rotator and path in your project npm install --save fs file-stream-rotator path Add the following code to your app.js file: var FileStreamRotator = require('file-stream-rotator') var express = require('express') var fs = require('fs') var morgan = require('morg...
To understand this example, it is recommended to have a brief idea on Bellman-Ford single source shortest path algorithm which can be found here In Bellman-Ford algorithm, to find out the shortest path, we need to relax all the edges of the graph. This process is repeated at most (V-1) times, where...
Write all events with level: debug, info, warn, error and fatal to one file: <?xml version="1.0" ?> <nlog xmlns="http://www.nlog-project.org/schemas/NLog.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"> <targets> &lt...
Create one log file for each day. The log files will have the following names (dependent of culture) 2016-06-05.log 2016-06-06.log 2016-06-07.log ... <?xml version="1.0" ?> <nlog xmlns="http://www.nlog-project.org/schemas/NLog.xsd" xmlns:xsi="http://w...
using NLog; using NLog.Config; using NLog.Targets; namespace MyNamespace { [Target("MyFirst")] public sealed class MyFirstTarget: TargetWithLayout //or inherit from Target { public MyFirstTarget() { //set defaults ...
To understand this example, it is recommended to have a brief idea about Bellman-Ford algorithm which can be found here Using Bellman-Ford algorithm, we can detect if there is a negative cycle in our graph. We know that, to find out the shortest path, we need to relax all the edges of the graph (V-...
Here is an example of a basic page using the Materialize CSS framework which incorporates the grid system and materialboxed. <!DOCTYPE html> <html> <head> <title>Materializecss Example webpage</title> <!--Import Google Icon Font--> <link href="ht...
Adjacency list is a collection of unordered lists used to represent a finite graph. Each list describes the set of neighbors of a vertex in a graph. It takes less memory to store graphs. Let's see a graph, and its adjacency matrix: Now we create a list using these values. This is called adjacen...
>>> from sympy.solvers.inequalities import solve_univariate_inequality >>> from sympy import var >>> x=var('x') >>> solve_univariate_inequality(2*x**2-6>1,x,relational=False) (-oo, -sqrt(14)/2) U (sqrt(14)/2, oo) The relational=False parameter simply ind...
Floyd-Warshall's algorithm is for finding shortest paths in a weighted graph with positive or negative edge weights. A single execution of the algorithm will find the lengths (summed weights) of the shortest paths between all pair of vertices. With a little variation, it can print the shortest path ...
// 1.0, Revealing Module pattern var myNamespace = myNamespace || {}; myNamespace.example = (function () { /** * User Event 1.0 example detailing usage of the Submit events * * @appliedtorecord employee */ var exports = {}; function beforeSubmit(type)...
After the record gets stored in the database, we want to inspect what was changed on the record. We'll do this inspection by comparing values between the old and new record instances. // 1.0, Revealing Module pattern var myNamespace = myNamespace || {}; myNamespace.example = (function () { ...
// 1.0 // Revealing Module pattern, structures 1.0 similar to 2.0 var myNamespace = myNamespace || {}; myNamespace.example = (function () { /** @appliedtorecord employee */ var exports = {}; function beforeLoad(type, form, request) { showBonusEligibility(form); ...
// 1.0 // Utilize the type argument and raw Strings to filter your // execution by the action function beforeLoad(type, form, request) { // Don't do anything on APPROVE // Note that `type` is an Object, so we must use ==, not === if (type == "approve") { return...
In SuiteScript 1.0, we retrieve the current execution context using nlapiGetContext().getExecutionContext(), then we compare the result to the appropriate raw Strings. // 1.0 in Revealing Module pattern var myNamespace = myNamespace || {}; myNamespace.example = (function () { var exports =...
The STDIN stream in Julia refers to standard input. This can represent either user input, for interactive command-line programs, or input from a file or pipeline that has been redirected into the program. The readline function, when not provided any arguments, will read data from STDIN until a newl...
Reading numbers from standard input is a combination of reading strings and parsing such strings as numbers. The parse function is used to parse a string into the desired number type: julia> parse(Int, "17") 17 julia> parse(Float32, "-3e6") -3.0f6 The format expec...
Reading strings or bytes Files can be opened for reading using the open function, which is often used together with do block syntax: open("myfile") do f for (i, line) in enumerate(eachline(f)) print("Line $i: $line") end end Suppose myfile exists and its ...
public class MyClass { public void foo() { Logger logger = Bukkit.getLogger(); logger.info("A log message"); logger.log(Level.INFO, "Another message"); logger.fine("A fine message"); // logging an exception try { ...

Page 507 of 693