Tutorial by Examples: ti

In some cases you may want to change which notification you use based on a tag in the Alert keys. You can do this using the Lookup feature. Note: Lookup only works if you are using OpenTSDB and sending data to the Bosun to be indexed. For other backends or non-indexed data you have to use lookupSeri...
To enable Code First Migrations in entity framework, use the command Enable-Migrations on the Package Manager Console. You need to have a valid DbContext implementation containing your database objects managed by EF. In this example the database context will contain to objects BlogPost and Auth...
After you've enabled migrations (please refer to this example) you are now able to create your first migration containing an initial creation of all database tables, indexes and connections. A migration can be created by using the command Add-Migration <migration-name> This command will c...
Note that the allowDiskUse: true option is optional but will help mitigate out of memory issues as this aggregation can be a memory intensive operation if your collection size is large - so i recommend to always use it. var duplicates = []; db.transactions.aggregate([ { $group: { _id: { c...
01 field-1 PIC X(80) BASED. ALLOCATE field-1 *> use field-1 FREE field-1 *> further use of field-1 will cause memory corruption
Given Example class extending BaseExample class with some properties: open class BaseExample(val baseField: String) class Example(val field1: String, val field2: Int, baseField: String): BaseExample(baseField) { val field3: String get() = "Property without backing ...
Consider the dataframes left and right left = pd.DataFrame([['a', 1], ['b', 2]], list('XY'), list('AB')) left A B X a 1 Y b 2 right = pd.DataFrame([['a', 3], ['b', 4]], list('XY'), list('AC')) right A C X a 3 Y b 4 join Think of join as wanting to combine to dat...
type Dog = Dog String dogName1 dog = case dog of Dog name -> name dogName2 (Dog name) -> name dogName1 and dogName2 are equivalent. Note that this only works for ADTs that have a single constructor. type alias Pet = { name: String , weight: Float ...
extern crate gtk; use gtk::prelude::*; use gtk::{Window, WindowType, Label, Entry, Box as GtkBox, Orientation}; fn main() { if gtk::init().is_err() { println!("Failed to initialize GTK."); return; } let window = Window::new(WindowType::Toplevel); ...
IF A = 1 OR 2 THEN perform miracles END-IF IF A = 1 OR 2 AND B = 1 THEN perform rites-of-passage ELSE perform song-and-dance END-IF IF statements can be terminated with full stop or explicit scope terminator END-IF. Use of periods for scope termination is no longer recommend...
Will talk about directory structure of CakePHP, what each folder means. CakePHP has some main folders app - It Contains our application source code, all our code lies under this directory. lib - This is the cakephp core liberary, it contains all the base cakephp library code. Editing code insid...
Errors, when managed properly by the server, will be returned to your client with a specific HTTP status code different from 2xx (see RFC 2616 section 10). It's advised to catch globally your errors from your $.ajaxSetup() as demonstrated in the example below. Therefore all errors coming from your ...
A closure is a procedure that holds internal state: Define a procedure that returns a closure The procedure make-an-adder takes one argument x and returns a function that closes over the value. Or to put it another way, x is within the lexical scope of the returned function. #lang racket (define...
Have you ever wondered how the search engines work? How does Google line-up millions of results in front of you in just a few milliseconds? How does a huge database situated thousands of miles away from you find out information you're searching for and send them back to you? The reason behind this i...
01 fillertest. 03 fillertest-1 PIC 9(10) value 2222222222. 03 filler PIC X value '|'. 03 fillertest-2 PIC X(10) value all 'A'. 03 filler PIC 9(03) value 111. 03 filler PIC X value '.'. INITIALIZE fillertest INITIALIZE fillertest REPLACING NUM...
One of the most important implementations of Dynamic Programming is finding out the Longest Common Subsequence. Let's define some of the basic terminologies first. Subsequence: A subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the orde...
GCobol identification division. program-id. inspecting. data division. working-storage section. 01 ORIGINAL pic XXXX/XX/XXBXX/XX/XXXXXXX/XX. 01 DATEREC pic XXXX/XX/XXBXX/XX/XXXXXXX/XX. procedure division. move fun...
Before reading this example, it is highly recommended that you read Introduction to Trie first. One of the easiest ways of implementing Trie is using linked list. Node: The nodes will consist of: Variable for End-Mark. Pointer Array to the next Node. The End-Mark variable will simply denot...
Before reading this example, it is required to have a brief idea on edge-relaxation. You can learn it from here Bellman-Ford Algorithm is computes the shortest paths from a single source vertex to all of the other vertices in a weighted digraph. Even though it is slower than Dijkstra's Algorithm, i...

Page 359 of 505