{"id":19099194,"url":"https://github.com/diev/sectionstest","last_synced_at":"2026-06-25T09:31:32.644Z","repository":{"id":109042504,"uuid":"435249417","full_name":"diev/SectionsTest","owner":"diev","description":"Задача об отрезках в какой-то точке","archived":false,"fork":false,"pushed_at":"2021-12-05T21:31:52.000Z","size":13,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-01-03T01:28:56.686Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/diev.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-12-05T18:41:45.000Z","updated_at":"2021-12-05T21:31:55.000Z","dependencies_parsed_at":null,"dependency_job_id":"44e6d08a-59d2-46f5-9ad8-37c094908c5d","html_url":"https://github.com/diev/SectionsTest","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/diev%2FSectionsTest","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diev%2FSectionsTest/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diev%2FSectionsTest/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/diev%2FSectionsTest/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/diev","download_url":"https://codeload.github.com/diev/SectionsTest/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240154954,"owners_count":19756548,"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-09T03:49:03.894Z","updated_at":"2026-05-27T21:30:14.194Z","avatar_url":"https://github.com/diev.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SectionsTest\n\nЗадача об отрезках в какой-то точке.  \nРешение задачи разными способами на C++.\n\n## Константы для тестов\n\nВ программе заданы константы, что ширина листа 210 мм (А4).  \nКаждый отрезок длиной не более 1/10 ширины листа.  \nНачальная точка и длина каждого отрезка задаются случайно.  \nОбщее число отрезков 100000.\n            \n## Результаты\n\nПротестированные способы:\n\n1. Линейный поиск по всем отрезкам и всему диапазону.\n2. Отрезки отсортированы по точке начала и поиск прекращается после прохода искомой точки.\n3. Битовые поля, соответствующие отрезкам, шириной в лист.\n4. Приведение битовых полей к побитовым операциям размерностей x32 и x64 для сравнения.\n5. Работа с массивом x64 вместо массива структур.\n6. Прекращение поиска после прохода искомой точки.\n7. Предварительное сужение полосы прохода по длине предварительного наибольшего отрезка.\n\nДля контроля разных способов сравнивается число найденных отрезков.\n                          \n### По центру\n                    \nДля прогонов подставлена точка в центре ширины листа: 105.  \nНайдено пересекающих отрезков: 5472.  \nВремя каждого способа в таблице ниже:\n\n```\nEnter a test point [0..209]:\n105\nTest1,    matches: 5472, time: 0.0049566s\nTest2,    matches: 5472, time: 0.0012192s\nTest3,    matches: 5472, time: 0.0063362s\nTest4x32, matches: 5472, time: 0.0018483s\nTest4x64, matches: 5472, time: 0.0013827s\nTest5,    matches: 5472, time: 0.0007807s\nTest6,    matches: 5472, time: 0.0005161s\nTest7,    matches: 5472, time: 0.0002669s\n```\n\n### В начале\n\n```\nEnter a test point [0..209]:\n0\nTest1,    matches: 499, time: 0.001737s\nTest2,    matches: 499, time: 1.21e-05s\nTest3,    matches: 499, time: 0.0067402s\nTest4x32, matches: 499, time: 0.0016699s\nTest4x64, matches: 499, time: 0.0016441s\nTest5,    matches: 499, time: 0.0015882s\nTest6,    matches: 499, time: 2.03e-05s\nTest7,    matches: 499, time: 2.08e-05s\n```\n\n### В конце\n\n```\nEnter a test point [0..209]:\n209\nTest1,    matches: 507, time: 0.0032643s\nTest2,    matches: 507, time: 0.0021897s\nTest3,    matches: 507, time: 0.0067324s\nTest4x32, matches: 507, time: 0.0016257s\nTest4x64, matches: 507, time: 0.0021194s\nTest5,    matches: 507, time: 0.0007385s\nTest6,    matches: 507, time: 0.0006449s\nTest7,    matches: 507, time: 0.0001129s\n```\n\n## Програмная среда\n\nMicrosoft Visual Studio Community 2022 (64bit).  \nПродукт: Microsoft Visual C++ 2022  \nТип шаблона проекта: Пустой проект, C++.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdiev%2Fsectionstest","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdiev%2Fsectionstest","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdiev%2Fsectionstest/lists"}