| // v2 of the great example of SSE in go by @ismasan. | |
| // includes fixes: | |
| // * infinite loop ending in panic | |
| // * closing a client twice | |
| // * potentially blocked listen() from closing a connection during multiplex step. | |
| package main | |
| import ( | |
| "fmt" | |
| "log" |
| function Search-FileIndex { | |
| <# | |
| .PARAMETER Path | |
| Absoloute or relative path. Has to be in the Search Index for results to be presented. | |
| .PARAMETER Pattern | |
| File name or pattern to search for. Defaults to no values. Aliased to Filter to ergonomically match Get-ChildItem. | |
| .PARAMETER Text | |
| Free text to search for in the files defined by the pattern. | |
| .PARAMETER Recurse | |
| Add the parameter to perform a recursive search. Default is false. |
| #include "stdio.h" | |
| #include "stdlib.h" | |
| #define M 3 | |
| typedef struct _node { | |
| int n; /* n < M No. of keys in node will always less than order of B tree */ | |
| int keys[M - 1]; /*array of keys*/ | |
| struct _node *p[M]; /* (n+1 pointers will be in use) */ | |
| } node; |
| /* | |
| Copy from: http://web.archive.org/web/20090617110918/http://www.openasthra.com/c-tidbits/printing-binary-trees-in-ascii/ | |
| Source: http://web.archive.org/web/20071224095835/http://www.openasthra.com:80/wp-content/uploads/2007/12/binary_trees1.c | |
| */ | |
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> |
| package main | |
| import ( | |
| "fmt" | |
| "sync" | |
| ) | |
| func main() { | |
| var wg sync.WaitGroup | |
| var m sync.Map |
| package pubsub | |
| import ( | |
| "github.com/garyburd/redigo/redis" | |
| log "github.com/sirupsen/logrus" | |
| ) | |
| // Service service | |
| type Service struct { | |
| pool *redis.Pool |
08/16/17 by Sergey Grebenshchikov
This is a quick tutorial on how to test code using the GoMock mocking library and the standard library testing package testing.
GoMock is a mock framework for Go. It enjoys a somewhat official status as part of the github.com/golang organization, integrates well with the built-in testing package, and provides a flexible expectation API.
In computer science, the event loop, message dispatcher, message loop, message pump, or run loop is a programming construct that waits for and dispatches events or messages in a program.
It works by making a request to some internal or external "event provider" (that generally blocks the request until an event has arrived), and then it calls the relevant event handler ("dispatches the event").
The event-loop may be used in conjunction with a reactor, if the event provider follows the file interface, which can be selected or 'polled' (the Unix system call, not actual polling).
The event loop almost always operates asynchronously with the message originator.
| How to build on an x86-64 linux system: | |
| nasm -f elf64 hal.s | |
| gcc -Wall -Wextra -c coop-sched.c | |
| gcc -o tryit *.o | |
| ./tryit | |
| There's still one bug, more in the comments of the source file(s)! |
| // | |
| // main.cpp | |
| // NeuralNetwork | |
| // | |
| // Created by Santiago Becerra on 9/15/19. | |
| // Copyright © 2019 Santiago Becerra. All rights reserved. | |
| // | |
| // | |
| #include <iostream> |
