repo_name stringlengths 1 52 | repo_creator stringclasses 6
values | programming_language stringclasses 4
values | code stringlengths 0 9.68M | num_lines int64 1 234k |
|---|---|---|---|---|
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.LinkedList.SinglyLinkedList
{
public class SinglyLinkedList<T>
{
// points to the start of the list
private SinglyLinkedListNode<T>? Head { get; set; }
/// <summary>
/// Adds new node to the start o... | 158 |
C-Sharp | TheAlgorithms | C# | namespace DataStructures.LinkedList.SinglyLinkedList
{
public class SinglyLinkedListNode<T>
{
public SinglyLinkedListNode(T data)
{
Data = data;
Next = null;
}
public T Data { get; }
public SinglyLinkedListNode<T>? Next { get; set; }
}
}
| 16 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;
namespace DataStructures.LinkedList.SkipList
{
/// <summary>
/// Skip list implementation that is based on the singly linked list,
/// but offers O(log n) time complexity on most operations.
/// </summary>
... | 221 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Diagnostics;
namespace DataStructures.LinkedList.SkipList
{
[DebuggerDisplay("Key = {Key}, Height = {Height}, Value = {Value}")]
internal class SkipListNode<TValue>
{
public SkipListNode(int key, TValue? value, int height)
{
Key = key;
Valu... | 26 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Text.Json;
namespace DataStructures.Probabilistic
{
public class BloomFilter<T> where T : notnull
{
private const uint FnvPrime = 16777619;
private const uint FnvOffse... | 91 |
C-Sharp | TheAlgorithms | C# | using System;
namespace DataStructures.Probabilistic
{
public class CountMinSketch<T> where T : notnull
{
private readonly int[][] sketch;
private readonly int numHashes;
/// <summary>
/// Initializes a new instance of the <see cref="CountMinSketch{T}"/> class based off dime... | 79 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
namespace DataStructures.Probabilistic
{
public class HyperLogLog<T> where T : notnull
{
private const int P = 16;
private const double Alpha = .673;
private readonly int[] registers;
private readonly HashSet<... | 71 |
C-Sharp | TheAlgorithms | C# | using System;
namespace DataStructures.Queue
{
/// <summary>
/// Implementation of an array based queue. FIFO style.
/// </summary>
/// <typeparam name="T">Generic Type.</typeparam>
public class ArrayBasedQueue<T>
{
private readonly T[] queue;
private int endIndex;
p... | 109 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
namespace DataStructures.Queue
{
/// <summary>
/// Implementation of a list based queue. FIFO style.
/// </summary>
/// <typeparam name="T">Generic Type.</typeparam>
public class ListBasedQueue<T>
{
private readonly ... | 78 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.Queue
{
/// <summary>
/// Implementation of a stack based queue. FIFO style.
/// </summary>
/// <remarks>
/// Enqueue is O(1) and Dequeue is amortized O(1).
/// </remarks>
/// <typeparam name="T">Generic Typ... | 98 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.RedBlackTree
{
/// <summary>
/// A self-balancing bindary tree.
/// </summary>
/// <remarks>
/// A red-black tree is a self-balancing binary search tree (BST) that
/// stores a color with each node. A node's co... | 873 |
C-Sharp | TheAlgorithms | C# | namespace DataStructures.RedBlackTree
{
/// <summary>
/// Enum to represent node colors.
/// </summary>
public enum NodeColor : byte
{
/// <summary>
/// Represents red node
/// </summary>
Red,
/// <summary>
/// Represents black node
... | 62 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.ScapegoatTree
{
public static class Extensions
{
/// <summary>
/// Flattens scapegoat tree into a list of nodes.
/// </summary>
/// <param name="root">Scapegoat tree provided as root node.</param>
/... | 57 |
C-Sharp | TheAlgorithms | C# | using System;
namespace DataStructures.ScapegoatTree
{
/// <summary>
/// Scapegoat tree node class.
/// </summary>
/// <typeparam name="TKey">Scapegoat tree node key type.</typeparam>
public class Node<TKey> where TKey : IComparable
{
private Node<TKey>? right;
private Node<TKey... | 89 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.ScapegoatTree
{
/// <summary>
/// A scapegoat implementation class.
/// See https://en.wikipedia.org/wiki/Scapegoat_tree for more information about scapegoat tree.
/// </summary>
/// <typeparam name="TKey">The scapegoat tree k... | 374 |
C-Sharp | TheAlgorithms | C# | using System;
namespace DataStructures.SegmentTrees
{
/// <summary>
/// Goal: Data structure with which you can quickly perform queries on an array (i.e. sum of subarray)
/// and at the same time efficiently update an entry
/// or apply a distributive operation to a subarray.
/// ... | 105 |
C-Sharp | TheAlgorithms | C# | using System;
namespace DataStructures.SegmentTrees
{
/// <summary>
/// This is an extension of a segment tree, which allows applying distributive operations to a subarray
/// (in this case multiplication).
/// </summary>
public class SegmentTreeApply : SegmentTree
{
/// <summar... | 111 |
C-Sharp | TheAlgorithms | C# | namespace DataStructures.SegmentTrees
{
/// <summary>
/// This is an extension of a segment tree, which allows the update of a single element.
/// </summary>
public class SegmentTreeUpdate : SegmentTree
{
/// <summary>
/// Initializes a new instance of the <see cref="SegmentT... | 49 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.Stack
{
/// <summary>
/// Implementation of an array-based stack. LIFO style.
/// </summary>
/// <typeparam name="T">Generic Type.</typeparam>
public class ArrayBasedStack<T>
{
private const int DefaultCapac... | 124 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.Stack
{
/// <summary>
/// Implementation of a list based stack. FILO style.
/// </summary>
/// <typeparam name="T">Generic Type.</typeparam>
public class ListBasedStack<T>
{
/// <summary>
/// <se... | 96 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.Tries
{
/// <summary>
/// A Trie is a data structure (particular case of m-ary tree) used to efficiently represent strings with common prefixes.
/// Originally posed by E. Fredkin in 1960.
/// Fredkin, Edward (Sept. 1960), "Tr... | 125 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace DataStructures.Tries
{
/// <summary>
/// This class represents the nodes of a trie.
/// </summary>
internal class TrieNode
{
/// <summary>
/// Initializes a new instance of the <see cref="TrieNode"/> class. This instance was ... | 70 |
C-Sharp | TheAlgorithms | C# | using System.Collections.Generic;
namespace DataStructures.UnrolledList
{
/// <summary>
/// Unrolled linked list is a linked list of small arrays,
/// all of the same size where each is so small that the insertion
/// or deletion is fast and quick, but large enough to fill the cache line.
/// </... | 87 |
C-Sharp | TheAlgorithms | C# | using System;
namespace DataStructures.UnrolledList
{
/// <summary>
/// Single node with array buffer for unrolled list.
/// </summary>
public class UnrolledLinkedListNode
{
private readonly int[] array;
public UnrolledLinkedListNode(int nodeSize)
{
Next = nu... | 57 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using DataStructures.AATree;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests
{
internal class AaTreeTests
{
[Test]
public void Constructor_UseCustomComparer_FormsCorrectTree()
{
... | 298 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using DataStructures.AVLTree;
using FluentAssertions;
using NUnit.Framework;
using static FluentAssertions.FluentActions;
namespace DataStructures.Tests
{
internal class AvlTreeTests
{
private static readonly int[] Data = { 1, 2, 3, 4, ... | 390 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using DataStructures.BinarySearchTree;
using NUnit.Framework;
namespace DataStructures.Tests
{
public static class BinarySearchTreeTests
{
[Test]
public static void Constructor_UseCustomComparer_FormsCorrectTree()
{
... | 285 |
C-Sharp | TheAlgorithms | C# | using System;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests
{
/// <summary>
/// This class contains some tests for the class BitArray.
/// </summary>
public static class BitArrayTests
{
[Test]
public static void TestIndexer()
{
... | 536 |
C-Sharp | TheAlgorithms | C# | using System.Collections.Generic;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests
{
public class InvertedIndexTests
{
[Test]
public void Or_GetSourcesWithAtLeastOneFromList_ReturnAllSources()
{
var index = new InvertedIndex();
var... | 38 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using DataStructures.RedBlackTree;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests
{
internal class RedBlackTreeTests
{
[Test]
public void Constructor_UseCustomComparer_FormsCorrect_Tree()
{... | 380 |
C-Sharp | TheAlgorithms | C# | using System.Collections.Generic;
using System.Linq;
using NUnit.Framework;
namespace DataStructures.Tests
{
[TestFixture]
public class SortedListTests
{
[Test]
public void Add_AddMultipleValues_SortingCorrectly(
[Random(1, 1000, 100, Distinct = true)]
int count)
... | 127 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using FluentAssertions;
using FluentAssertions.Execution;
using NUnit.Framework;
namespace DataStructures.Tests
{
public static class TimelineTests
{
[Test]
public static void CountTest()
{
var timeline = new... | 1,144 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.Cache;
using NUnit.Framework;
using FluentAssertions;
namespace DataStructures.Tests.Cache
{
public static class LfuCacheTests
{
[Test]
public static void TestPutGet()
{
var cache = new LfuCache<int, string>();
cache.Put(1, "one... | 79 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.Cache;
using NUnit.Framework;
using FluentAssertions;
namespace DataStructures.Tests.Cache
{
public static class LruCacheTests
{
[Test]
public static void TestPutGet()
{
var cache = new LruCache<int, string>();
cache.Put(1, "one... | 71 |
C-Sharp | TheAlgorithms | C# | using DataStructures.DisjointSet;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.DisjointSet
{
[TestFixture]
public class DisjointSetTests
{
[Test]
public static void MakeSetDataInitializationTest()
{
DisjointSet<int> ds = new();
... | 34 |
C-Sharp | TheAlgorithms | C# | using DataStructures.Fenwick;
using NUnit.Framework;
using FluentAssertions;
using System;
namespace DataStructures.Tests.Fenwick
{
[TestFixture]
internal class BinaryIndexedTreeTests
{
[Test]
public void GetSum_CreateBITAndRequestSum_ReturnCorrect()
{
int[] array = { 2,... | 38 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using DataStructures.Graph;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.Graph
{
[TestFixture]
public class DirectedWeightedGraphTests
{
[Test]
[TestCase(-1)]
[TestCase(-2)]
... | 218 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using DataStructures.Heap;
using NUnit.Framework;
namespace DataStructures.Tests.Heap
{
internal static class BinaryHeapTests
{
private static BinaryHeap<int> BuildTestHeap()
{
var heap = new BinaryHeap<int>();
var elems... | 157 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using DataStructures.Heap;
using NUnit.Framework;
namespace DataStructures.Tests.Heap
{
[TestFixture]
public static class MinMaxHeapTests
{
private static readonly object[] CollectionsSource =
{
new[] { 5, 10,... | 164 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.Heap.FibonacciHeap;
using NUnit.Framework;
namespace DataStructures.Tests.Heap.FibonacciHeaps
{
internal class TestFHeap : FibonacciHeap<int>
{
public void RawCut(FHeapNode<int> x, FHeapNode<int> y)
{
Cut(x, y);
}
public void Ra... | 279 |
C-Sharp | TheAlgorithms | C# | using System.Collections.Generic;
using DataStructures.Heap.PairingHeap;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.Heap.PairingHeap
{
internal class PairingHeapComparerTests
{
[Test]
public void Compare_CheckAscending_ReturnNegative()
{
... | 35 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections;
using System.Linq;
using DataStructures.Heap.PairingHeap;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.Heap.PairingHeap
{
internal class PairingHeapTests
{
[Test]
public void BuildMinHeap_CheckEnumerator_NotThrowOnEnume... | 158 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Linq;
using DataStructures.LinkedList.DoublyLinkedList;
using NUnit.Framework;
namespace DataStructures.Tests.LinkedList
{
public static class DoublyLinkedListTests
{
[Test]
public static void TestGetData()
{
var dll = new DoublyLinkedList<int>(new... | 136 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Linq;
using DataStructures.LinkedList.SinglyLinkedList;
using NUnit.Framework;
namespace DataStructures.Tests.LinkedList
{
public static class LinkedListTests
{
[Test]
public static void LengthWorksCorrectly([Random(0, 1000, 100)] int quantity)
{
... | 111 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.LinkedList.SkipList;
using NUnit.Framework;
using FluentAssertions;
using System.Collections.Generic;
namespace DataStructures.Tests.LinkedList
{
public static class SkipListTests
{
[Test]
public static void TestAdd()
{
var list = new SkipL... | 124 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using DataStructures.Probabilistic;
using NUnit.Framework;
namespace DataStructures.Tests.Probabilistic
{
public class BloomFilterTests
{
static readonly string[] TestNames = { "kal;jsnfka", "alkjsdfn;lakm", "aljfo... | 119 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using DataStructures.Probabilistic;
using NUnit.Framework;
using FluentAssertions;
namespace DataStructures.Tests.Probabilistic
{
public class CountMinSketchTests
{
public class SimpleObject
{
public string Name { get; set; }
... | 92 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using DataStructures.Probabilistic;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.Probabilistic
{
public class HyperLogLogTest
{
[Test]
public void TestHyperLogLog()
{
var hll = new HyperLogLo... | 62 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Text;
using DataStructures.Queue;
using NUnit.Framework;
namespace DataStructures.Tests.Queue
{
public static class ArrayBasedQueueTests
{
[Test]
public static void DequeueWorksCorrectly()
{
// Arrange
var q = new ArrayBasedQueue<cha... | 134 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Text;
using DataStructures.Queue;
using NUnit.Framework;
namespace DataStructures.Tests.Queue
{
public static class ListBasedQueueTests
{
[Test]
public static void DequeueWorksCorrectly()
{
// Arrange
var q = new ListBasedQueue<char>... | 112 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Text;
using DataStructures.Queue;
using NUnit.Framework;
namespace DataStructures.Tests.Queue
{
public static class StackBasedQueueTests
{
[Test]
public static void DequeueWorksCorrectly()
{
// Arrange
var q = new StackBasedQueue<cha... | 112 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using DataStructures.ScapegoatTree;
using NUnit.Framework;
namespace DataStructures.Tests.ScapegoatTree
{
public class ExtensionsTests
{
[Test]
public void RebuildFlatTree_ValidFlatTree_RebuildsTree()
{
var expected = new Node<... | 60 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.ScapegoatTree;
using NUnit.Framework;
namespace DataStructures.Tests.ScapegoatTree
{
[TestFixture]
public class ScapegoatTreeNodeTests
{
[Test]
[TestCase(2,1)]
[TestCase("B", "A")]
public void RightSetter_OtherKeyPrecedesRightKey_ThrowsExce... | 189 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using DataStructures.ScapegoatTree;
using NUnit.Framework;
namespace DataStructures.Tests.ScapegoatTree
{
public class ScapegoatTreeTests
{
[Test]
public void Constructor_NoParameters_InstanceIsValid()
{
var tree = new Scapegoa... | 461 |
C-Sharp | TheAlgorithms | C# | using DataStructures.SegmentTrees;
using NUnit.Framework;
namespace DataStructures.Tests.SegmentTrees
{
[TestFixture]
public class SegmentTreeApplyTests
{
private readonly SegmentTreeApply testTree = new(new[] { 8, 9, 1, 4, 8, 7, 2 });
[Test]
public void Apply_Query_Update_Query_Te... | 21 |
C-Sharp | TheAlgorithms | C# | using DataStructures.SegmentTrees;
using NUnit.Framework;
namespace DataStructures.Tests.SegmentTrees
{
[TestFixture]
public class SegmentTreeTests
{
private readonly SegmentTree testTree = new(new[] { 8, 9, 1, 4, 8, 7, 2 });
[Test]
public void TreeArray_Test()
{
... | 26 |
C-Sharp | TheAlgorithms | C# | using DataStructures.SegmentTrees;
using NUnit.Framework;
namespace DataStructures.Tests.SegmentTrees
{
[TestFixture]
public class SegmentTreeUpdateTests
{
[SetUp]
public void Init()
{
testTree = new SegmentTreeUpdate(new[] { 8, 9, 1, 4, 8, 7, 2 });
}
pr... | 26 |
C-Sharp | TheAlgorithms | C# | using DataStructures.Stack;
using FluentAssertions;
using NUnit.Framework;
using System;
using System.Linq;
namespace DataStructures.Tests.Stack
{
public static class ArrayBasedStackTests
{
private const string StackEmptyErrorMessage = "Stack is empty";
[Test]
public static void Cou... | 135 |
C-Sharp | TheAlgorithms | C# | using DataStructures.Stack;
using FluentAssertions;
using NUnit.Framework;
using System.Linq;
namespace DataStructures.Tests.Stack
{
public static class ListBasedStackTests
{
[Test]
public static void CountTest()
{
var stack = new ListBasedStack<int>(new[] { 0, 1, 2, 3, 4... | 87 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.Tries;
using NUnit.Framework;
namespace DataStructures.Tests.Tries
{
public static class TrieTests
{
[Test]
public static void FindWordInTrie(){
// Arrange
string[] words = {
"trie",
"node",
... | 116 |
C-Sharp | TheAlgorithms | C# | using System;
using DataStructures.UnrolledList;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.UnrolledList
{
public class UnrolledLinkedListNodeTests
{
[Test]
public void GetAndSet_SetItemNodeAndGetIt_ReturnExpectedItem()
{
var node = new ... | 62 |
C-Sharp | TheAlgorithms | C# | using DataStructures.UnrolledList;
using FluentAssertions;
using NUnit.Framework;
namespace DataStructures.Tests.UnrolledList
{
public class UnrolledLinkedListTests
{
[Test]
public void Insert_LinkArrayToLinkedList_ReturnArrayHaveSameItems()
{
var linkedList = new Unrolle... | 25 |
C-Sharp | TheAlgorithms | C# | using System;
namespace Utilities.Exceptions
{
/// <summary>
/// Signs that sequence doesn't contain any items that one was looking for.
/// </summary>
public class ItemNotFoundException : Exception
{
}
}
| 12 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
namespace Utilities.Extensions
{
public static class DictionaryExtensions
{
/// <summary>
/// Adds the specified key value tuples to the dictionary.
/// </summary>
/// <param name="keys">The dictionary.</param>
/// <... | 29 |
C-Sharp | TheAlgorithms | C# | using System;
namespace Utilities.Extensions
{
public static class MatrixExtensions
{
/// <summary>
/// Performs immutable dot product multiplication on source matrix to operand.
/// </summary>
/// <param name="source">Source left matrix.</param>
/// <param name="ope... | 185 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Linq;
namespace Utilities.Extensions
{
public static class RandomExtensions
{
/// <summary>
/// Returns a random normalized vector of the specified size.
/// </summary>
/// <param name="rand">The random number generator.</param>
/// <param ... | 23 |
C-Sharp | TheAlgorithms | C# | using System;
namespace Utilities.Extensions
{
public static class VectorExtensions
{
/// <summary>
/// Makes a copy of a vector. Changes to the copy should not affect the original.
/// </summary>
/// <param name="vector">The vector.</param>
/// <returns>The copy.</r... | 154 |
C-Sharp | TheAlgorithms | C# | using System;
using System.Collections.Generic;
using FluentAssertions;
using NUnit.Framework;
using Utilities.Extensions;
namespace Utilities.Tests.Extensions
{
public class DictionaryExtensionsTests
{
[Test]
public void AddMany_ShouldThrowArgumentException_WhenKeyAlreadyExists()
{
... | 38 |
C-Sharp | TheAlgorithms | C# | using System;
using FluentAssertions;
using NUnit.Framework;
using Utilities.Extensions;
namespace Utilities.Tests.Extensions
{
public class MatrixExtensionsTests
{
private static readonly object[] MatrixMultiplyTestCases =
{
new object[]
{
new double[,] ... | 212 |
C-Sharp | TheAlgorithms | C# | using System;
using FluentAssertions;
using NUnit.Framework;
using Utilities.Extensions;
namespace Utilities.Tests.Extensions
{
public class RandomExtensionsTests
{
[Test]
public void NextVector_ShouldReturnNormalizedVector()
{
var random = new Random(0);
var... | 22 |
C-Sharp | TheAlgorithms | C# | using System;
using FluentAssertions;
using NUnit.Framework;
using Utilities.Extensions;
namespace Utilities.Tests.Extensions
{
public class VectorExtensionsTests
{
[Test]
public void Copy_ShouldReturnCopyOfVector()
{
var vector = new double[] { 0, 1, 2, 3 };
... | 138 |
amazon-cognito-dotnet | aws | C# | using Amazon.Runtime.Internal.Util;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace Amazon.Runtime.Internal.Util
{
public interface ILogger
{
}
public class LoggerInstance : ILogger
{
}
public class Logger... | 83 |
amazon-cognito-dotnet | aws | C# | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace CustomFxCopRules
{
public class MD5User
{
System.Security.Cryptography.MD5 md5Prop { get; set; }
System.Security.Cryptography.MD5 md5Field;
private static str... | 27 |
amazon-cognito-dotnet | aws | C# | using Microsoft.FxCop.Sdk;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace CustomFxCopRules
{
internal sealed class PreventHashAlgorithmCreateRule : SdkCustomRule
{
public PreventHashAlgorithmCreateRule()
: bas... | 60 |
amazon-cognito-dotnet | aws | C# | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using Microsoft.FxCop.Sdk;
using System.Reflection;
namespace CustomFxCopRules
{
internal sealed class PreventMD5UseRule : SdkCustomRule
{
public PreventMD5UseRule()
: base... | 98 |
amazon-cognito-dotnet | aws | C# | using Microsoft.FxCop.Sdk;
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace CustomFxCopRules
{
internal sealed class PreventStaticLoggersRule : SdkCustomRule
{
public PreventStaticLoggersRule()
: base("PreventSt... | 77 |
amazon-cognito-dotnet | aws | C# | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using Microsoft.FxCop.Sdk;
using System.Reflection;
namespace CustomFxCopRules
{
internal abstract class SdkCustomRule : BaseIntrospectionRule
{
protected SdkCustomRule(string ruleName... | 18 |
amazon-cognito-dotnet | aws | C# | using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Xml;
namespace CustomFxCopRules.Test
{
class Program
{
static void Main(string[] args)
{
var expectedIssues ... | 46 |
amazon-cognito-dotnet | aws | C# | using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
[assembly: AssemblyTitle("... | 37 |
amazon-cognito-dotnet | aws | C# | using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
[assembly: AssemblyTitle("... | 37 |
amazon-cognito-dotnet | aws | C# | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using Microsoft.Build.Utilities;
using System.IO;
using System.Xml;
using System.Reflection;
namespace CustomTasks
{
public class UpdateFxCopProject : Task
{
public string Assemblies { get; set; }
public s... | 162 |
amazon-cognito-dotnet | aws | C# | using System.Reflection;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
// General Information about an assembly is controlled through the following
// set of attributes. Change these attribute values to modify the information
// associated with an assembly.
[assembly: AssemblyTitle("... | 37 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using System.Collections.Generic;
using Amazon.Runtime;
using Amazon.CognitoSync.SyncManager.Internal;
using Amazon.CognitoIdentity;
using Logger = Amazon.Runtime.Internal... | 264 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using Amazon.CognitoIdentity;
using Amazon.CognitoSync.SyncManager.Internal;
using Amazon.Runtime.Internal;
using Amazon.Runtime.Internal.Util;
using Logger = Amazon.Runtime.Internal.Util... | 914 |
amazon-cognito-sync-manager-net | aws | C# | /*
 * Copyright 2010-2013 Amazon.com, Inc. or its affiliates. All Rights Reserved.
 *Â
 * Licensed under the Apache License, Version 2.0 (the "License").
 * You may not use this file except in compliance with the License.
 * A copy of the License is located at
 *Â
 *  h... | 40 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// This exception is thrown when an update fails due to conflicting states
/// </summary>
#if !PCL
... | 58 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// This exception is thrown when the dataset operation exceeds certain limit,
/// e.g. maximum of 20 ... | 62 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// This exception is thrown when the dataset that is attempted to access does
/// not exist.
/// ... | 59 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using Amazon.Runtime;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// This exception is thrown when an error occurs during an data storage
/// ope... | 60 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// This exception is thrown when a service request failed due to network
/// connectivity problem.
... | 59 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using Amazon.Runtime;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// This exception is thrown when an error occurs during an data storage
/// ope... | 61 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using System.Globalization;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// Metadata information representing a dataset
/// </summary>
public s... | 111 |
amazon-cognito-sync-manager-net | aws | C# | using System;
using System.Collections.Generic;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// A model class which stores a list of updated dataset.
/// </summary>
public class DatasetUpdates
{
private string _datasetName;
private List<Record> _records;
pri... | 119 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using Amazon.CognitoSync.SyncManager.Internal;
using System.Globalization;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// A Record is the element st... | 146 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// A model which stores conflicting record from the remote storage and the local storage.
/// </summa... | 119 |
amazon-cognito-sync-manager-net | aws | C# | using System.Runtime.InteropServices;
[assembly: ComVisible(false)]
[assembly: System.CLSCompliant(true)]
[assembly: System.Security.AllowPartiallyTrustedCallers] | 5 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using System.IO;
using Amazon.Runtime;
using Amazon.CognitoIdentity;
using Amazon.CognitoSync.Model;
namespace Amazon.CognitoSync.SyncManager.Internal
{
/// <summary>
... | 160 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using System.Collections;
using System.Collections.Generic;
namespace Amazon.CognitoSync.SyncManager
{
/// <summary>
/// A local storage like a sqlite database on ... | 189 |
amazon-cognito-sync-manager-net | aws | C# | //
// Copyright 2014-2015 Amazon.com,
// Inc. or its affiliates. All Rights Reserved.
//
// SPDX-License-Identifier: Apache-2.0
//
using System;
using System.Collections;
using System.Collections.Generic;
using System.Runtime.InteropServices;
using Amazon.Runtime;
using Amazon.CognitoSync.SyncManager;
using Amazon.C... | 1,069 |
amazon-cognito-sync-manager-net | aws | C# | #if AWS_ASYNC_API
using System;
using System.Collections.Generic;
using System.Threading.Tasks;
using System.Threading;
using Amazon.CognitoSync.Model;
namespace Amazon.CognitoSync.SyncManager.Internal
{
/// <summary>
/// Remote data storage using Cognito Sync service on which we can invoke
/// actions... | 221 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.