| /*** | |
| * Excerpted from "The Definitive ANTLR 4 Reference", | |
| * published by The Pragmatic Bookshelf. | |
| * Copyrights apply to this code. It may not be used to create training material, | |
| * courses, books, articles, and the like. Contact us if you are in doubt. | |
| * We make no guarantees that this code is fit for any purpose. | |
| * Visit http://www.pragmaticprogrammer.com/titles/tpantlr2 for more book information. | |
| ***/ | |
| import org.antlr.v4.runtime.*; | |
| import org.antlr.v4.runtime.tree.ParseTree; |
| -- Create a group | |
| CREATE ROLE readaccess; | |
| -- Grant access to existing tables | |
| GRANT USAGE ON SCHEMA public TO readaccess; | |
| GRANT SELECT ON ALL TABLES IN SCHEMA public TO readaccess; | |
| -- Grant access to future tables | |
| ALTER DEFAULT PRIVILEGES IN SCHEMA public GRANT SELECT ON TABLES TO readaccess; |
Copyright © 2016-2018 Fantasyland Institute of Learning. All rights reserved.
A function is a mapping from one set, called a domain, to another set, called the codomain. A function associates every element in the domain with exactly one element in the codomain. In Scala, both domain and codomain are types.
val square : Int => Int = x => x * x
C++ code style written in markdown.
Astyle code automatic formatting settings
You can use clang-format too.
Use tools like vera++
| #ifndef _MACARON_BASE64_H_ | |
| #define _MACARON_BASE64_H_ | |
| /** | |
| * The MIT License (MIT) | |
| * Copyright (c) 2016-2024 tomykaira | |
| * | |
| * Permission is hereby granted, free of charge, to any person obtaining | |
| * a copy of this software and associated documentation files (the | |
| * "Software"), to deal in the Software without restriction, including |
| /** | |
| * Solves the n-Queen puzzle in O(n!) | |
| * Let p[r] be the column of the queen on the rth row (must be exactly 1 queen per row) | |
| * There also must be exactly 1 queen per column and hence p must be a permuation of (0 until n) | |
| * There must be n distinct (col + diag) and n distinct (col - diag) for each queen (else bishop attacks) | |
| * @return returns a Iterator of solutions | |
| * Each solution is an array p of length n such that p[i] is the column of the queen on the ith row | |
| */ | |
| def nQueens(n: Int): Iterator[Seq[Int]] = | |
| (0 until n) |
| #Packet sniffer in python for Linux | |
| #Sniffs only incoming TCP packet | |
| import socket, sys | |
| from struct import * | |
| #create an INET, STREAMing socket | |
| try: | |
| s = socket.socket(socket.AF_INET, socket.SOCK_RAW, socket.IPPROTO_TCP) | |
| except socket.error , msg: |
| SELECT blocked_locks.pid AS blocked_pid, | |
| blocked_activity.usename AS blocked_user, | |
| now() - blocked_activity.query_start | |
| AS blocked_duration, | |
| blocking_locks.pid AS blocking_pid, | |
| blocking_activity.usename AS blocking_user, | |
| now() - blocking_activity.query_start | |
| AS blocking_duration, | |
| blocked_activity.query AS blocked_statement, | |
| blocking_activity.query AS blocking_statement |
| # Hello, and welcome to makefile basics. | |
| # | |
| # You will learn why `make` is so great, and why, despite its "weird" syntax, | |
| # it is actually a highly expressive, efficient, and powerful way to build | |
| # programs. | |
| # | |
| # Once you're done here, go to | |
| # http://www.gnu.org/software/make/manual/make.html | |
| # to learn SOOOO much more. |
