{"id":21231098,"url":"https://github.com/izevaka/nearmap-test","last_synced_at":"2025-07-10T16:33:23.380Z","repository":{"id":4513071,"uuid":"5652809","full_name":"izevaka/nearmap-test","owner":"izevaka","description":"Nearmap technical screen","archived":false,"fork":false,"pushed_at":"2017-08-22T06:09:41.000Z","size":106,"stargazers_count":0,"open_issues_count":0,"forks_count":5,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-04-21T01:55:00.593Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/izevaka.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2012-09-02T23:52:02.000Z","updated_at":"2024-04-21T01:55:00.594Z","dependencies_parsed_at":"2022-09-02T21:20:39.713Z","dependency_job_id":null,"html_url":"https://github.com/izevaka/nearmap-test","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izevaka%2Fnearmap-test","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izevaka%2Fnearmap-test/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izevaka%2Fnearmap-test/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izevaka%2Fnearmap-test/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/izevaka","download_url":"https://codeload.github.com/izevaka/nearmap-test/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":225649016,"owners_count":17502183,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-20T23:40:58.129Z","updated_at":"2024-11-20T23:40:58.587Z","avatar_url":"https://github.com/izevaka.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# nearmap.com Technical Test\r\nWelcome to [nearmap.com](nearmap.com) technical test. The purpose of this assignment is to test your familiarity with C#, distributed systems concepts, performance benchmarking and TDD.\r\n\r\n## Background\r\nThe source code that you are given is a very simple imitation of a name/value store. `DatabaseStore` is the canonical data store that takes a while (50 ms) to store and retrieve data. `DistributedCacheStore` is an interface to a distributed cache that takes much less time to turn around - 5 ms. This scenario is a simplified example of a typical high performance server cluster with a database, a distributed cache and multiple worker nodes.\r\n\r\n## Assumptions \r\n* Data in the canonical store (database) never changes and can be cached forever.\r\n* Data is never written to the canonical store (database), apart from during the startup.\r\n* If `GetValue` method returns `null`, the request data item does not exist and will never exist.\r\n* The solution should start with the distributed cache empty.\r\n* Provided code can be modified at will.\r\n* The aim of the test is to produce the simplest working solution to the problem. As such you are at liberty to choose any .NET framework classes.\r\n\r\n## Task\r\n* The objective is to create a data retrival mechanism with lowest possible latency by implementing the `IDataSource` interface.\r\n* The solution should have a better response time than that one of distributed cache for a frequently requested item, i.e. response time should be faster than 5ms.\r\n* The solution should have unit tests for all new functionality.\r\n* The user of the `IDataStore` interface must not have to deal with thread synchronisation.\r\n* The database should be populated with the following data on startup:  \r\n\u003cpre\u003e\r\n    | key          | value         |\r\n    --------------------------------\r\n    | key0         | value0        |\r\n    | key1         | value1        |\r\n    | key2         | value2        |\r\n    | key3         | value3        |\r\n    | key4         | value4        |\r\n    | key5         | value5        |\r\n    | key6         | value6        |\r\n    | key7         | value7        |\r\n    | key8         | value8        |\r\n    | key9         | value9        |\r\n\u003c/pre\u003e\r\n* The solution must have 10 threads each making 50 consecutive requests for a random key in the range (key0-key9). I.e. there would a total of 500 requests.\r\n* The solution must print the managed ThreadId, requested key name, returned value, time to complete that request, similar to the following example:  \r\n\u003cpre\u003e\r\n    [1] Request 'key1', response 'value1', time: 50.05 ms\r\n    [2] Request 'key2', response 'value2', time: 50.05 ms\r\n\u003c/pre\u003e\r\n\r\n## Submission instructions\r\n* The whole Visual Studio solution must build with no errors.\r\n* If the solution is incomplete, please state what hasn't been finished and outline how you are planning on solving it.\r\n* DO NOT send pull requests against this repository because we don't want other candidates to see your solution.\r\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fizevaka%2Fnearmap-test","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fizevaka%2Fnearmap-test","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fizevaka%2Fnearmap-test/lists"}