Tutorial by Examples: at

Relative query

Current Item: bar (path: /sitecore/content/home/foo/bar) Query: query:./child/grandchild Result: grandchild (path: /sitecore/content/home/foo/bar/child/grandchild)

sitecore • Sitecore query syntax

Item attributes query

Query: query:/sitecore/content/[@@templatename='Homepage'] Result: home (name: home, path: /sitecore/content/home, template name: Homepage)

sitecore • Sitecore query syntax

Violation of CLS rule: Unsigned types / sbyte

using System; [assembly:CLSCompliant(true)] namespace CLSDoc { public class Car { internal UInt16 _yearOfCreation = 0; //Warning CS3008 Identifier '_numberOfDoors' is not CLS-compliant //Warning CS3003 Type of 'Car._numberOfDoors' is not CLS-compli...

C# Language • CLSCompliantAttribute

Violation of CLS rule: Same naming

using System; [assembly:CLSCompliant(true)] namespace CLSDoc { public class Car { //Warning CS3005 Identifier 'Car.CALCULATEAge()' differing only in case is not CLS-compliant public int CalculateAge() { return 0; } ...

C# Language • CLSCompliantAttribute

Violation of CLS rule: Identifier _

using System; [assembly:CLSCompliant(true)] namespace CLSDoc { public class Car { //Warning CS3008 Identifier '_age' is not CLS-complian public int _age = 0; } } You can not start variable with _

C# Language • CLSCompliantAttribute

Violation of CLS rule: Inherit from non CLSComplaint class

using System; [assembly:CLSCompliant(true)] namespace CLSDoc { [CLSCompliant(false)] public class Animal { public int age = 0; } //Warning CS3009 'Dog': base type 'Animal' is not CLS-compliant public class Dog : Animal { } }

C# Language • CLSCompliantAttribute

Finding the Shortest Path from Source to other Nodes

Breadth-first-search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes first, before moving to the next level neighbors. BFS was inve...

algorithm • Breadth-First Search

Finding Shortest Path from Source in a 2D graph

Most of the time, we'll need to find out the shortest path from single source to all other nodes or a specific node in a 2D graph. Say for example: we want to find out how many moves are required for a knight to reach a certain square in a chessboard, or we have an array where some cells are blocked...

algorithm • Breadth-First Search

Installation or Setup

Detailed instructions on getting actionscript set up or installed.

actionscript • Getting started with actionscript

Illustration of Basic mapping (Handy shortcuts).

In most text editors, the standard shortcut for saving the current document is Ctrl+S (or Cmd+S on macOS). Vim doesn't have this feature by default but this can be mapped to make things easier. Adding the following lines in .vimrc file will do the job. nnoremap <c-s> :w<CR> inoremap &...

vim • Key Mappings in Vim

Master - Slave Replication Setup

Consider 2 MySQL Servers for replication setup, one is a Master and the other is a Slave. We are going to configure the Master that it should keep a log of every action performed on it. We are going to configure the Slave server that it should look at the log on the Master and whenever changes happ...

MySQL • Replication

Replication Errors

Whenever there is an error while running a query on the slave, MySQL stop replication automatically to identify the problem and fix it. This mainly because an event caused a duplicate key or a row was not found and it cannot be updated or deleted. You can skip such errors, even if this is not recomm...

MySQL • Replication

Underlining a text in a UILabel using Objective C

UILabel *label=[[UILabel alloc]initWithFrame:CGRectMake(0, 0, 320, 480)]; label.backgroundColor=[UIColor lightGrayColor]; NSMutableAttributedString *attributedString; attributedString = [[NSMutableAttributedString alloc] initWithString:@"Apply Underlining"]; [attributedString addAttrib...

iOS • UILabel text underlining

Negation

You may want to negate a boolean value, i.e. enter an if statement when a condition is false rather than true. This can be done by using the -Not CmdLet $test = "test" if (-Not $test -eq "test2"){ Write-Host "if condition not met" } You can also use !: $test...

PowerShell • Conditional logic

Force a Test Crash With Fabric

Add a button you can tap to trigger a crash. Paste this code into your layout where you’d like the button to appear. <Button android:layout_height="wrap_content" android:layout_width="wrap_content" android:text="Force Crash!" android:onClick=&quo...

Android • Crash Reporting Tools

Objective C code to convert HTML string to NSAttributedString and Vice Versa

HTML to NSAttributedString conversion Code :- //HTML String NSString *htmlString=[[NSString alloc]initWithFormat:@"<!DOCTYPE html><html><body><h1>My First Heading</h1><p>My first paragraph.</p></body></html>"]; //Converting HTML s...

iOS • Convert HTML to NSAttributed string and vice verse

Using PhantomData as a Type Marker

Using the PhantomData type like this allows you to use a specific type without needing it to be part of the Struct. use std::marker::PhantomData; struct Authenticator<T: GetInstance> { _marker: PhantomData<*const T>, // Using `*const T` indicates that we do not own a T } imp...

Rust • PhantomData

Simple usage for anything that has a Length member

let inline getLength s = (^a: (member Length: _) s) //usage: getLength "Hello World" // or "Hello World" |> getLength // returns 11

F# • Statically Resolved Type Parameters

Bucket Sort Basic Information

Bucket Sort is a sorting algorithm in which elements of input array are distributed in buckets. After distributing all the elements, buckets are sorted individually by another sorting algorithm. Sometimes it is also sorted by recursive method. Pseudo code for Bucket Sort Let n be the length of t...

algorithm • Bucket Sort

Merge Sort Implementation in C & C#

C Merge Sort int merge(int arr[],int l,int m,int h) { int arr1[10],arr2[10]; // Two temporary arrays to hold the two arrays to be merged int n1,n2,i,j,k; n1=m-l+1; n2=h-m; for(i=0; i<n1; i++) arr1[i]=arr[l+i]; for(j=0; j<n2; j++) arr2[j]=arr[m+j+1]; arr...

algorithm • Merge Sort