text stringlengths 0 14.1k |
|---|
ticks: []Tick{{123, 1, 4}, {123, 7, -1}}, |
}, |
0, 1, 1, |
true, |
}, |
{ |
Block{ |
ticks: []Tick{{654, 4, 6}, {4, 63, 5}, {4, 5, 9}}, |
}, |
1, 1, 1, |
false, |
}, |
{ |
Block{}, |
1, 1, 1, |
true, |
}, |
} |
for _, tB := range testBlocks { |
chunk.SetBlock(tB.x, tB.y, tB.z, tB.Block) |
if block := chunk.GetBlock(tB.x, tB.y, tB.z); !tB.Block.EqualBlock(block) { |
t.Errorf(""blocks do not match, expecting %s, got %s"", tB.Block.String(), block.String()) |
} |
} |
for _, tB := range testBlocks { |
if tB.recheck { |
if block := chunk.GetBlock(tB.x, tB.y, tB.z); !tB.Block.EqualBlock(block) { |
t.Errorf(""blocks do not match, expecting:-\n%s\ngot:-\n%s"", tB.Block.String(), block.String()) |
} |
} |
} |
} |
func TestHeightMap(t *testing.T) { |
tests := []struct { |
x, y, z int32 |
Block |
height int32 |
}{ |
{0, 0, 0, Block{}, 0}, |
{1, 0, 0, Block{ID: 1}, 1}, |
{1, 1, 0, Block{ID: 1}, 2}, |
{1, 0, 0, Block{}, 2}, |
{1, 1, 0, Block{}, 0}, |
{2, 10, 0, Block{ID: 1}, 11}, |
{2, 12, 0, Block{ID: 1}, 13}, |
{2, 12, 0, Block{}, 11}, |
{2, 10, 0, Block{}, 0}, |
{3, 15, 0, Block{ID: 1}, 16}, |
{3, 16, 0, Block{ID: 1}, 17}, |
{3, 16, 0, Block{}, 16}, |
{3, 15, 0, Block{}, 0}, |
{4, 31, 0, Block{ID: 1}, 32}, |
{4, 32, 0, Block{ID: 1}, 33}, |
{4, 32, 0, Block{}, 32}, |
{4, 31, 0, Block{}, 0}, |
{5, 16, 0, Block{ID: 1}, 17}, |
{5, 32, 0, Block{ID: 1}, 33}, |
{5, 32, 0, Block{}, 17}, |
{5, 16, 0, Block{}, 0}, |
} |
chunk, _ := newChunk(0, 0, nbt.Tag{}) |
for n, test := range tests { |
chunk.SetBlock(test.x, test.y, test.z, test.Block) |
if h := chunk.GetHeight(test.x, test.z); h != test.height { |
t.Errorf(""test %d: expecting height %d, got %d"", n+1, test.height, h) |
} |
} |
} |
" isc |
spratt/SumOfDistances SumOfDistances.cpp 1069 "/////////////////////////////////////////////////////////////////////////////// |
// Copyright (c) 2011 - 2012 by // |
// Simon Pratt // |
// (All rights reserved) // |
/////////////////////////////////////////////////////////////////////////////// |
// // |
// FILE: SumOfDistances.cpp // |
// // |
// MODULE: Sum Of Distances // |
// // |
// NOTES: Assumes vectors are sorted. // |
// // |
/////////////////////////////////////////////////////////////////////////////// |
#include ""SumOfDistances.h"" |
" isc |
restfb/restfb.github.io javadoc/src-html/com/restfb/types/send/ListViewElement.html 10136 "<!DOCTYPE HTML> |
<html lang=""de""> |
<head> |
<!-- Generated by javadoc (17) --> |
<title>Source code</title> |
<meta name=""viewport"" content=""width=device-width, initial-scale=1""> |
<meta name=""description"" content=""source: package: com.restfb.types.send, class: ListViewElement""> |
<meta name=""generator"" content=""javadoc/SourceToHTMLConverter""> |
<link rel=""stylesheet"" type=""text/css"" href=""../../../../../stylesheet.css"" title=""Style""> |
</head> |
<body class=""source-page""> |
<main role=""main""> |
<div class=""source-container""> |
<pre><span class=""source-line-no"">001</span><span id=""line-1"">// Generated by delombok at Mon Feb 14 17:40:58 CET 2022</span> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.