hi all!
This script is no long maintained, however i do have a friend who has made a far better solution to this problem!
please see https://github.com/totallynotinteresting/crossover for more info :)
if possible could you please star his repo too?
hi all!
This script is no long maintained, however i do have a friend who has made a far better solution to this problem!
please see https://github.com/totallynotinteresting/crossover for more info :)
if possible could you please star his repo too?
| public class AsyncLock | |
| { | |
| private readonly SemaphoreSlim semaphore = new SemaphoreSlim(1, 1); | |
| private readonly Task<IDisposable> releaser; | |
| public AsyncLock() | |
| { | |
| releaser = Task.FromResult((IDisposable)new AsyncLockReleaser(this)); | |
| } |
| public sealed class TaskDictionary<TRequest, TResult> | |
| where TRequest : notnull | |
| { | |
| public TaskDictionary(IEqualityComparer<TRequest>? comparer = null) | |
| { | |
| _dictionary = new(comparer); | |
| } | |
| public Task<TResult> GetOrAdd(TRequest request) | |
| { |
| using System; | |
| using System.Collections.Generic; | |
| using System.Text; | |
| namespace ProbabilisticDataStructures.DataStructures | |
| { | |
| public class BitSet | |
| { | |
| private ulong[] bitset; | |
| public int Size { get; private set; } |
| # used different forum posts/guides to figure this out like: | |
| # The uninstall script is located at /Library/Parallels/Parallels Service.app/Contents/Resources | |
| # https://github.com/danijeljw/remparallels/blob/master/remprls.sh | |
| # https://kb.parallels.com/122461 | |
| # sudo find / -iname "*parallels*" | |
| # sudo find / -iname "*prl*" | |
| #before uninstalling deactivate your licencse - this won't be possible after uninstall | |
| prlsrvctl deactivate-license |
| using System; | |
| using System.Globalization; | |
| using System.Net; | |
| using System.Net.Sockets; | |
| using System.Text; | |
| using System.Threading.Tasks; | |
| namespace Socks | |
| { | |
| public static class Socks5 |
| using System; | |
| using System.Diagnostics.Contracts; | |
| using System.Runtime.CompilerServices; | |
| public static class SpanSplitExtensions | |
| { | |
| public ref struct Enumerable1<T> where T : IEquatable<T> | |
| { | |
| public Enumerable1(ReadOnlySpan<T> span, T separator) | |
| { |
| // copyright Toru Niina 2018. distributed under the Boost Software License v1.0. | |
| // it provides an implementation of ReLU without branching. | |
| // the core idea of branchless-ReLU is the following. | |
| // 1. first, bitwise-and with 0 bits everytime returns 0 bits. but bitwise-and | |
| // with 1 bits returns the original argument kept intact. | |
| // 0000 & 1010 == 0000, 1111 & 1010 == 1010 | |
| // 2. second, we can make 0 bits or 1 bits depending on the sign bit by applying | |
| // right arithmetic shift 31 times. | |
| // 1000 >> 31 == 1111, 0110 >> 31 == 0000 |
Features2D + Homography to find a known object http://docs.opencv.org/3.2.0/d9/d97/tutorial_table_of_content_features2d.html ported to OpenCV 3.2.0
@echo off
REM git clone -b 3.2.0 --depth 1 --recursive https://github.com/opencv/opencv_contrib.git
REM OR Download https://github.com/opencv/opencv_contrib/archive/3.2.0.zip