id stringlengths 1 3 | code_masked stringlengths 783 188k | target stringlengths 3 27 |
|---|---|---|
0 | #include "BiDirectionalRpc.hpp"
#include "TimeHandler.hpp"
namespace codefs {
BiDirectionalRpc::BiDirectionalRpc()
: onBarrier(0),
onId(0),
flaky(false),
timeOffsetController(1.0, 1000000, -1000000, 0.6, 1.2, 1.0) {}
BiDirectionalRpc::~BiDirectionalRpc() {}
void BiDirectionalRpc::shutdown() {}... | ping |
1 | #ifndef CATCH_UP_ENGINE_SRC_INCLUDE_COMPONENT_BASE_H
#define CATCH_UP_ENGINE_SRC_INCLUDE_COMPONENT_BASE_H
#include <entt\entt.hpp>
#include <string>
#include "uuid.h"
#include "component.h"
namespace Engine
{
class CollisionListener;
class Timestep;
class GameObject;
class Scene
{
public:
... | instance |
2 |
#ifndef _PYODBCSQLWCHAR_H
#define _PYODBCSQLWCHAR_H
typedef unsigned short ODBCCHAR;
// I'm not sure why, but unixODBC seems to define SQLWCHAR as wchar_t even with
// the size is incorrect. So we might get 4-byte SQLWCHAR on 64-bit Linux even
// though it requires 2-byte characters. We have to define our own type ... | _ctype |
3 | /**
* This Sketch reads a Resistor Ladder to determine a pitch to send
* to the Piezo unit. It's designed to be used like an Electronic
* Keyboard =)
*
*/
const int NOTES[] = { 262, 294, 330, 349 };
void setup()
{
Serial.begin(9600);
}
void loop()
{
int keyValue = analogRead(A0);
makeSoundForKey(key... | amount |
4 | //*****************************************************************************
// Copyright 2020-2022 Intel Corporation
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://w... | rets |
5 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
// freopen(".in", "r", stdin);
// freopen(".out", "w", stdout);
int [MASK] ;
ll numDays;
cin >> [MASK] >> numDays;
vector<pair<ll, int>> deliveries;
... | numDeliveries |
6 | #include "rclcpp/rclcpp.hpp"
#include "sensor_msgs/msg/laser_scan.hpp"
class LidarFilterNode : public rclcpp::Node
{
public:
LidarFilterNode() : Node("lidar_filter_node")
{
subscription_ = this->create_subscription<sensor_msgs::msg::LaserScan>(
"/scan", 10, std::bind(&LidarFilterNode::liste... | argc |
7 | // Copyright (c) 2025 <NAME>
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in w... | argc |
8 | #include<iostream>
using namespace std;
struct Patient{
int patientID, hieght, wieght, visionNo;
string testStatus;
Patient* next;
int data;
Patient(int p, int h, int w, int v, string t, Patient* n, int d){
patientID = p;
hieght = h;
wieght = w;
visionNo = v;
testStatus = t;
next = n;
data = d;
}
... | patient1 |
9 | #ifndef _BTREE_H_
#define _BTREE_H_
#include <string>
#include <utility>
#include <cstring>
#include <iostream>
#include <algorithm>
#include "algo/ParamTrait.h"
namespace snippet {
namespace algo {
namespace detail {
template<typename KType, typename VType, unsigned int NodeSize = 512>
class BTreeNode
{
public:
... | cur_key |
10 | #pragma once
#include <stdint.h>
#include <cmath>
#include <numbers>
#include <Geode/Geode.hpp>
namespace allium {
class DrawNodeExtension;
struct Point {
double x = 0.0;
double y = 0.0;
Point() = default;
Point(double x, double y)
: x(x), y(y)
{};
... | a21 |
11 | /*
* FontTextureManagerAndroid.cpp
* WhirlyGlobeLib
*
* Created by <NAME> on 6/2/14.
* Copyright 2011-2016 mousebird consulting
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at... | charRenderClass |
12 | #include "cardashboard.h"
#include <QPainter>
#include <QPainterPath>
#include <QRadialGradient>
#include <QtMath>
#include <QTimer>
CarDashBoard::CarDashBoard(QWidget *parent)
: QWidget{parent}
{
margin = 5;
spanAngle = 240;//仪表盘占用角度
startAngle = (180-spanAngle)/2.0 ;//仪表盘开始角度
animation = false;
... | radiusIn |
13 | /*
File: laponia_battle.cpp
Last changed: 14/06/2023 14:00
Purpose: Console-based matrix war game
Authors: <NAME>
<NAME>
<NAME>
<NAME>
Usage:
HowToCompile: gcc laponia_battle.cpp -o laponia_battle
HowToExecute: ./laponia_batt... | peca |
14 | #include <iostream>
#include <fstream>
#include <string>
using namespace std;
// Structure to hold student information
struct Student {
string name;
int rollNumber;
string address;
string phoneNumber;
};
// Function to display menu options
void displayMenu() {
cout << "========= S... | inputFile |
15 | #include "../../Algorithm.hpp"
int main()
{
std::vector<int> arr;
for (int i = 0; i < 10000; ++i)
arr.push_back(i);
std::default_random_engine g(time(0));
auto [MASK] = std::chrono::system_clock::now();
auto end = std::chrono::system_clock::now();
std::chrono::duration<double> elapsed_seconds... | start |
16 | #ifndef IPC_SOCKET_CONNECTION_HPP
#define IPC_SOCKET_CONNECTION_HPP
#include "../FileDescriptor.hpp"
#include "../Utils.hpp"
#include "Address.hpp"
#include "Type.hpp"
namespace ipc {
namespace socket {
class Connection {
public:
explicit Connection(FileDescriptor fd) : fd_(std::move(fd)) {}
ssize_t Recv(... | sock_type |
17 | #include <iostream>
#include "movies.hh"
#include "utilities.hh"
//#define DEBUG
#ifdef DEBUG
#define dout std::cout
#else
#define dout 0 && std::cout
#endif
int main()
{
std::cout << "Welcome to the movies!" << std::endl;
std::cout << "----------------------" << std::endl;
std::cout << "---------------... | stored_filename |
RefineID-format C++ identifier recovery from The Stack v3
This public benchmark contains 1,000 examples from 1,000 source repositories and 3,961 masked identifier positions. Each example is a full source file with one chosen identifier name masked at every eligible identifier token position. The target is the original name.
Format and use
test.csv has no header and exactly three columns in the same order as the
original RefineID benchmark: id, code_masked, target. IDs are 0 through
999. Each target position is the literal, whitespace-delimited
[MASK]. test.parquet holds the identical rows with named string columns and
is the default Hugging Face test split:
from datasets import load_dataset
ds = load_dataset("D4vidHuang/refineid-stack-v3-cpp", split="test")
assert len(ds) == 1000
provenance.jsonl is aligned by ID and records the upstream repository, commit,
file path, content ID, detected SPDX licenses, source revision, source text hash,
and the half-open Unicode character spans used for masking. manifest.json
records checksums, parameters and corpus-level counts.
Construction and interpretation
Source: HuggingFaceCode/stack-v3-train
at commit 8f3f25d86e44fd691428131efd17af75d4716499. We use the upstream PII-redacted,
quality-filtered train corpus and accept only files marked permissive with
detected licenses. Vendored files, short/oversized files, parse failures,
ambiguous identifier uses, and files with a few obvious remaining sensitive
patterns are excluded. Candidates whose target spelling remains visible in
comments, strings, or other code are also excluded. A seeded Parquet traversal selects at most one
example per repository for this language. This is a deterministic convenience
sample, not a uniform random sample of all Stack v3 files. See the manifest
for the exact seed and scan boundary.
The source is a single code snapshot. These examples evaluate identifier name recovery; they are not observed before/after rename commits. Syntax-tree filters reduce false targets, but they do not prove compiler-resolved binding, compilation, or behavior. Original RefineID has a different source and length/ site distribution, so scores across the two datasets require separate reporting.
License and removal
The Stack v3 collection is ODC-By. Each source file retains its original license;
this dataset does not assign one blanket license to the underlying code. Check the per-row
detected_licenses and upstream repository before reuse. License detection
and PII redaction are imperfect. The Stack v3 card documents its
opt-out process. We pin an
upstream release and will review new opt-outs before future republishes.
Citation
Please cite The Stack v3 dataset card and the original RefineID paper when using this benchmark.
- Downloads last month
- -