cwielenb/CNCF-Dataset huggingface dataset:
Project: DeepFlow (Observability and Analysis / Observability)
File: integration_collector.pdf

使用文档
HTTP_PROXY 默认绑定 38086 端口，端口可以在控制器更改 , AGENT_IP 指metaflow-agent 运行所在环境
的IP
接收OpenTelemetry 追踪数据
将已压缩 OpenTelemetry 信息通过 HTTP POST 请求发送
curl -v -i --data-binary @otel.gzip -H 'Content-Encoding: gzip' http://AGENT_IP:38086/api/
将OpenTelemetry 信息通过 HTTP POST 请求发送
curl -v --data @otel.bin http://AGENT_IP:38086/api/v1/otel/trace 
接收Prometheus 监控数据
在prometheus.yaml 配置远程写入
# Settings related to the remote write feature. 
remote_write: 
    - url: http://AGENT_IP:38086/api/v1/prometheus 
接收Telegraf 监控数据
在telegraf.conf 配置HTTP 代理
[[outputs.http]] 
## URL is the address to send metrics to 
    url = "http://127.0.0.1:38086/api/v1/telegraf" 
    data_format = "influx"
Project: HAProxy (Orchestration & Management / Service Proxy)
File: pattern.pdf

struct pat_ref
This struct contain t he pattern
references. These ar e the string
representation of th e original pattern
input. This is used fo r for changing
entries.
 struct list list
Used to chain struct  pat_ref
 unsigned int fla gs
Free flags. Actually, it is used to
ndicate the usage of  this reference. It
can be PAT_REF_MA P and/or PAT_REF_AC L
 char *reference
The reference name .
 struct list pat
The head of the list of all struct
pattern_expr that us es this list.
 struct list head
The head of the list of all entries of
the reference. struct pat_ref_elt
This contain the bas ic data for one
pattern entry.
 struct list list
Used to chain
 char *pattern
Pattern as string form
 char *sample
Value as string form
 int line
The original line num ber.struct pattern_hea d
This struct constain a list of pattern
expressions that can  apply on ACL or
MAP.
 parse
The function used fo r parsing pattern
 parse_smp
The function used fo r parsing the
associated sample
 index
The function used fo r indexing the
pattern
 delete
The function used fo r deleting one
pattern
 looksmp
This function return the sample with
looking for the patte rn
 prune
This function clean p attern_expr
 match
This function check if value match the
pattern
 struct list head
This contain the hea d of the list of
all pattern_exprstruct pattern_exp r
This struct contain h e data relative to
one pattern.
 struct pattern_h ead *pat_head
the pattern_head ref erence
 struct pat_ref * ref
The reference
 struct list list
Used to chian in stru ct pat_ref
 struct list patt erns
Free use for indexing  patterns
 struct eb_root p attern_tree
Free use for indexing  patterns
 struct eb_root p attern_tree_2
Free use for indexing  patternsACL
MAP
Static list of
referencestruct pattern_exp r_list
This struct is just use d for
establishing the list of pattern that
depends of a pattern _head struct.
 struct list list
Used to chian in stru ct pat_ref
 int do_free
The pointer expr mu st be freed
 struct pattern_e xpr *expr
Free use for indexing  patternsWARNING: (struct pa ttern_head *)foo->h ead->(struct pattter n_expr_list)->expr-> pat_head CAN BE !=  foo.
struct pattern_tre e
This struct is elemen t of a tree
 struct ebmb_node  node
Used to chian in stru ct pat_ref
 struct sample_st orage
contain the sample
 struct pat_ref_e lt *elt
Reference to origina l pattern sourcestruct pattern_list
This struct is elemen t of a list
 struct list list
Used to chian in stru ct pat_ref
 struct pattern p attern
Reference to origina l pattern source
struct pattern
This struct contain t he values of the
pattern matching
 [...]
The vars and attribu tes forming the
pattern
 struct sample_st orage
contain the sample
 struct pat_ref_e lt *elt
Reference to origina l pattern sourceCreate static patte rn
based to the tree dataList
List
ListListList
Tree
Project: MetalLB (Orchestration & Management / Service Proxy)
File: adivorciarsetoca00cape.pdf

,_:_._;._7A6SACTOSCÓMICOS\DE.PeLLAvLUCIO
ICubiertadeesteLoretoPradoEnriqueChicoteyFranciscoMelgares
de¡Adivorciarsefocan!
123JACINTO^APELLAYJOSÉDESLUCIÓ¡ADIVORCIARSETOCJUGUETECÓMICO,ENTRESACTOSORIGINALEst/enadoenelTeatroCómico,deMadrid,eldía10deDiciembredeANTONIOMt>****3^'AÑOVI|5DEMARZODE1932MADRIDNÚM.234
REPARTOPERSONAJESACTORESValentinaLoretoPrado.CristinaConsueloNieva.EsmeraldinaCarmenL.SolíaJenaraJuliaMedero.LiberadaPePitadelCid-PetraLuisaMelchor.1>eresaJosefinaInfiesta.BiasaEmiliadelCid.Mcasia..'..'..AmaliaAnchorena.LudaNatividadRodrigue».PascasioEnriqueChicote.TeodoioFranciscoMelgares.AmadorJoséCuenca.CiríacoJoKéSampietro.ManoloRodolfoRecober.BenignoJoséLuciaFedericoAntonioMartínez.Miguel-JoséDelgado.BenitoJuanJiménezRomero.LaacciónenMadrid.—Épocaactual.-^Acotacionesdelladodelactor.Nqta.—Lascuatroúltimasmujeresyloscincoúltimoshombresadmiteneldoble.
Project: HAProxy (Orchestration & Management / Service Proxy)
File: muxes.pdf

Transport
I/O taskletapplication
mux−>subscribe(SUB_RECV)
MUX
Stream IDStream ID
tasklet_wakeup() tasklet_wakeup()mux−>snd_buf()mux−>rcv_buf()
xprt−>snd_buf(mbuf)xprt−>rcv_buf(dbuf)HTX contents when mode==HTTPtasklet_wakeup() tasklet_wakeup()
mux−>subscribe(SUB_SEND)mux streams mux=conn−>mux
Transport
encoding/decoding function
transport layer multiplexer (MUX/DEMUX)general processing function
stream buffer (byte−level FIFO)xprt−>subscribe(SUB_RECV) xprt−>subscribe(SUB_SEND)stconn
(eg: checks, streams)connection = sc−>sedesc−>connNotes:
snd_buf() will move the
buffer (zero−copy) when
the destination is empty.
− the application is also
is sc−>app with sc−>app_ops
− transport layers (xprt) are
stackable. conn−>xprt is
the topmost one.called the app layer and− mux−>rcv_buf() and
encode encode encode encode
decode decode decode decode
mux_io_cb mux_io_cbsc_conn_io_cb
channel bufrxbuf
dbufmbuf DEMUX
Project: HAProxy (Orchestration & Management / Service Proxy)
File: sched.pdf

Most UrgentGlobal
tasks
(locked)tasksLocal
(locked)timersGlobal
timersLocalLocal ?
Yes NoLocal ?
Yes NoClass?
pastfuturepastfuture
Oldestnewest
oldest
newest
oldest
runqueue−depthrunqueue−depthTime−based
Wait queues
− 1 global
− 1 per threadPriority−based
Run queues
− 1 global
− 1 per threadtask_wakeup() task_schedule()task_queue()
tasklet_wakeup() t−>process()Run!
37%
=1(accessed using atomic ops)
50%
13%YesLocal ?
No
TASK_SELF_WAKING
TASK_HEAVY(default)In I/O or signals
Most UrgentorderScan
5 class−based tasklet queues per thread (one accessible from remote threads)TL_URGENT
TL_NORMAL
TL_BULK
TL_HEAVYSHARED
Project: HAProxy (Orchestration & Management / Service Proxy)
File: lua_socket.pdf

lua_State *Tstruct hlua
stop_list *stop
struct stream_interface si[0]
enum obj_type *endstruct streamstack Lua
stack entry 0
stack entry 1
stack entry 2
struct hlua_socket
stack entry 3
stack entry 4(list)struct session
struct task *task
hlua_tcp_gc()
Called just before the object
garbaging(list)struct hlua_socket_com
struct task *task
struct appctx
struct <lua>
struct hlua_tcp *wrstruct hlua_tcp *rd
hlua_tcp_release()
Called when the applet is destroyed.update_tcp_handler()
Called on each change on the 
tcp connection state.struct xref *xref
struct xref *xref
Project: Apache NiFi (App Definition and Development / Streaming & Messaging)
File: simple.pdf

 A Simple PDF File 
 This is a small demonstration .pdf file - 
 just for use in the Virtual Mechanics tutorials. More text. And more 
 text. And more text. And more text. And more text. 
 And more text. And more text. And more text. And more text. And more 
 text. And more text. Boring, zzzzz. And more text. And more text. And 
 more text. And more text. And more text. And more text. And more text. 
 And more text. And more text. 
 And more text. And more text. And more text. And more text. And more 
 text. And more text. And more text. Even more. Continued on page 2 ... Simple PDF File 2 
 ...continued from page 1. Yet more text. And more text. And more text. 
 And more text. And more text. And more text. And more text. And more 
 text. Oh, how boring typing this stuff. But not as boring as watching 
 paint dry. And more text. And more text. And more text. And more text. 
 Boring.  More, a little more text. The end, and just as well.
Project: Druid (App Definition and Development / Database)
File: realtime_timeline.pdf

13:00 14:00 15:00
13:37
- node starts
- announce segment 
for data 13:00-14:0013:47
persist data for 13:00-14:00
~14:00
- announce segment 
for data 14:00-15:0014:10
- merge and handoff for data 13:00-14:00
- persist data for 14:00-15:00~14:11
- unannounce segment 
for data 13:00-14:00
13:57
persist data for 13:00-14:0014:07
persist data for 13:00-14:00
Project: Vald (App Definition and Development / Database)
File: Vald_brandguidelines.pdf

Vald
BRAND
GUIDELINES
Ver.1  February, 2021
© Vald teamVald BRAND
GUIDELINES
Contents 3......................
4......................
5......................
6......................
7......................
8......................
9......................Color logo mark RGB
Color logo mark CMYK
Monochrome logo mark
Using the full-color Vald Logo
Using the monochrome Vald Logo
Clear space & Logo sizing
What not to do with the logo
2Color logo mark
RGB
PRIMARY GRADIENT
SECONDARY GREEN  to
MAIN GREEN
MAIN GREEN
R0 G96 B118
HEX #006076
SECONDARY GREEN
R0 G186 B177
HEX #00BAB1
Dark Gray
R48 G48 B48
HEX #303030
34PRIMARY GRADIENT
SECONDARY GREEN to
MAIN GREEN
MAIN GREEN
C89 M54 Y52 K4
SECONDARY GREEN
C72 M0 Y41 K0
Dark Gray
C80 M74 Y72 K48Color logo mark
CMYKDark Gray
C80 M74 Y72 K48
R48 G48 B48
HEX #303030White
C0 M0 Y0 K0
R255 G255 B255
HEX #ffffffMonochrome 
logo mark
510% gray
#1a1a1a60% gray
#99999970% gray
#1a1a1a90% gray
#e5e5e5Using the full-color
Vald Logo
These examples show the correct application of the Vald 
Logo on different solid backgrounds. The almost color logo 
should be used on a background that’ s lighter than 70% 
gray. 
6If a background color makes the full-color logo hard to see, 
you should use a monochrome logo instead.Using the mono-
chrome Vald Logo
7Y
Y
YClear space buffers the logo icon from images, text, or 
other graphics that compromise its impact and visibility. Clear space &
Logo sizing
Clear space
We’ve optimized the Vald Logo for specific sizes. 
Minimum digital height: 35dp
Minimum print height:10mmLogo sizing
35dp 10mm
8/gid00055/gid00064/gid00075/gid00067ɾChange orientations
ɾAlter the propotions
ɾAdd visual effects
ɾUse any colors other than designated color
ɾChange the type layout
ɾChoose a different typeface
ɾPlace the mark on image that are too complex
ɾPlace objects in clear spaceDon’ tWhat not to do with 
the Logo
9
Project: Druid (App Definition and Development / Database)
File: realtime_pipeline.pdf

event_12345
event_23456
event_34567
event_35582
event_37193
event_78901
event_79902
event_79932
event_89012event_2849219
event_120202
…
event_90192
Real-time
Node 1
Real-time
Node 2
offset 1
offset 2
eventseventseventsKafka
Streaming events
Project: ArangoDB (App Definition and Development / Database)
File: iterator_concepts.pdf

Iterator Concepts
Author : David Abrahams, Jeremy Siek, Thomas Witt
Contact : dave@boost-consulting.com ,jsiek@osl.iu.edu ,witt@styleadvisor.com
Organization :Boost Consulting , Indiana University Open Systems Lab ,Zephyr Asso-
ciates, Inc.
Date : 2004-11-01
Copyright : Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2004.
abstract: The iterator concept checking classes provide a mechanism for a template to
report better error messages when a user instantiates the template with a type that
does not meet the requirements of the template.
For an introduction to using concept checking classes, see the documentation for the boost::concept_check
library.
Reference
Iterator Access Concepts
•Readable Iterator
•Writable Iterator
•Swappable Iterator
•Lvalue Iterator
Iterator Traversal Concepts
•Incrementable Iterator
•Single Pass Iterator
•Forward Traversal
•Bidirectional Traversal
•Random Access Traversal
iterator_concepts.hpp Synopsis
namespace boost_concepts {
// Iterator Access Concepts
template <typename Iterator>
1class ReadableIteratorConcept;
template <
typename Iterator
, typename ValueType = std::iterator_traits<Iterator>::value_type
>
class WritableIteratorConcept;
template <typename Iterator>
class SwappableIteratorConcept;
template <typename Iterator>
class LvalueIteratorConcept;
// Iterator Traversal Concepts
template <typename Iterator>
class IncrementableIteratorConcept;
template <typename Iterator>
class SinglePassIteratorConcept;
template <typename Iterator>
class ForwardTraversalConcept;
template <typename Iterator>
class BidirectionalTraversalConcept;
template <typename Iterator>
class RandomAccessTraversalConcept;
// Interoperability
template <typename Iterator, typename ConstIterator>
class InteroperableIteratorConcept;
}
2
Project: FoundationDB (App Definition and Development / Database)
File: Architecture.pdf

The client reads directly 
from the storage nodes, 
which use MVCC to 
provide a consistent 
snapshot.4
Writes are sent to 
the transactional
authority at 
commit time.3The client’s commit succeeds once the 
transaction is logged 
to multiple disks in 
the transactional 
authority.5a
A set of coordinators running PAXOS elects 
leaders and avoids “split 
brain” problems. They are 
not involved in individual 
transactions.Successful trans -
actions are sent 
to memory on 
the appropriate 
storage nodes.5b
transactional
authoritystorage nodes
coordinatorsThe transactional
authority enforces 
ACID guarantees.4Storage nodes lazily 
update data on disk 
based on transactional 
writes.6
5The transactionalauthority can 
remove transactions 
from disk once they 
are safely durable on 
the storage nodes.7A=6
A=6 A=6
A=6A:6A:6
A:6
Key-Value StoreWhen starting a 
transaction, the client 
requests a consistent 
read version from the 
transactional authority.21Applications can use 
multiple data models 
by speaking to
co-located layers.
Layers store data 
side-by-side in the 
cluster, usually in 
their own keyspace.Application
Code
Layer Layer
FDB
ClientFDB
Client
App servers use 
traditional load 
balancing for client 
requests.Key-Value Store Logical Archite cture
DISCLAIMER: Please do not try to infer system propert ies from this diagram .
For that information, please see the Key-Value S tore Features and
Known Limitations, or ask us a que stion.
Project: Druid (App Definition and Development / Database)
File: concise_plot.pdf

Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)Integer array size (bytes)
1e+041e+06
1e+02 1e+05 1e+08
CardinalityConcise compressed size (bytes)sorted
sorted
unsorted
Project: Druid (App Definition and Development / Database)
File: tpch_1gb.pdf

01234
count_star_interval
sum_all
sum_all_filter
sum_all_year
sum_price
top_100_commitdate
top_100_parts
top_100_parts_details
top_100_parts_filter
QueryTime (seconds)engine
Druid
MySQLMedian query time (100 runs) − 1GB data − single node
Project: Druid (App Definition and Development / Database)
File: tpch_scaling_factor.pdf

count_star_intervalsum_allsum_all_filtersum_all_yearsum_pricetop_100_commitdatetop_100_partstop_100_parts_detailstop_100_parts_filter
1 2 3 4 5 6Speedup FactorQuery
Cores 8 (1 node) 48 (6 nodes)Druid Scaling ... 100GB
Project: ArangoDB (App Definition and Development / Database)
File: iterator_traits.pdf

Iterator Traits
Author : David Abrahams
Contact : dave@boost-consulting.com
Organization :Boost Consulting
Date : 2004-11-01
Copyright : Copyright David Abrahams 2004.
abstract: Header <boost/iterator/iterator_traits.hpp> provides the ability to access
an iterator’s associated types using MPL-compatible metafunctions .
Overview
std::iterator_traits provides access to ﬁve associated types of any iterator: its value_type ,refer-
ence,pointer ,iterator_category , and difference_type . Unfortunately, such a“multi-valued”traits
template can be diﬃcult to use in a metaprogramming context. <boost/iterator/iterator_traits.hpp>
provides access to these types using a standard metafunctions .
Summary
Header <boost/iterator/iterator_traits.hpp> :
template <class Iterator>
struct iterator_value
{
typedef typename
std::iterator_traits<Iterator>::value_type
type;
};
template <class Iterator>
struct iterator_reference
{
typedef typename
std::iterator_traits<Iterator>::reference
type;
};
template <class Iterator>
struct iterator_pointer
{
typedef typename
std::iterator_traits<Iterator>::pointer
type;
1};
template <class Iterator>
struct iterator_difference
{
typedef typename
detail::iterator_traits<Iterator>::difference_type
type;
};
template <class Iterator>
struct iterator_category
{
typedef typename
detail::iterator_traits<Iterator>::iterator_category
type;
};
Broken Compiler Notes
Because of workarounds in Boost, you may ﬁnd that these metafunctions actually work better than the
facilities provided by your compiler’s standard library.
On compilers that don’t support partial specialization, such as Microsoft Visual C++ 6.0 or 7.0, you
may need to manually invoke BOOST BROKEN COMPILER TYPE TRAITS SPECIALIZATION on
thevalue_type of pointers that are passed to these metafunctions.
Because of bugs in the implementation of GCC-2.9x, the name of iterator_category is changed to
iterator_category_ on that compiler. A macro, BOOST_ITERATOR_CATEGORY , that expands to either
iterator_category oriterator_category_ , as appropriate to the platform, is provided for portability.
2
Project: Druid (App Definition and Development / Database)
File: tpch_100gb.pdf

aggregation top−n
0200400600
02500500075001000012500count_star_interval
sum_all
sum_all_filter
sum_all_year
sum_price
top_100_commitdate
top_100_parts
top_100_parts_details
top_100_parts_filter
QueryTime (seconds)engine
Druid
MySQLMedian Query Time (3+ runs) − 100GB data − single node
Project: ShardingSphere (App Definition and Development / Database)
File: adivorciarsetoca00cape.pdf

,_:_._;._7A6SACTOSCÓMICOS\DE.PeLLAvLUCIO
ICubiertadeesteLoretoPradoEnriqueChicoteyFranciscoMelgares
de¡Adivorciarsefocan!
123JACINTO^APELLAYJOSÉDESLUCIÓ¡ADIVORCIARSETOCJUGUETECÓMICO,ENTRESACTOSORIGINALEst/enadoenelTeatroCómico,deMadrid,eldía10deDiciembredeANTONIOMt>****3^'AÑOVI|5DEMARZODE1932MADRIDNÚM.234
REPARTOPERSONAJESACTORESValentinaLoretoPrado.CristinaConsueloNieva.EsmeraldinaCarmenL.SolíaJenaraJuliaMedero.LiberadaPePitadelCid-PetraLuisaMelchor.1>eresaJosefinaInfiesta.BiasaEmiliadelCid.Mcasia..'..'..AmaliaAnchorena.LudaNatividadRodrigue».PascasioEnriqueChicote.TeodoioFranciscoMelgares.AmadorJoséCuenca.CiríacoJoKéSampietro.ManoloRodolfoRecober.BenignoJoséLuciaFedericoAntonioMartínez.Miguel-JoséDelgado.BenitoJuanJiménezRomero.LaacciónenMadrid.—Épocaactual.-^Acotacionesdelladodelactor.Nqta.—Lascuatroúltimasmujeresyloscincoúltimoshombresadmiteneldoble.
Project: Druid (App Definition and Development / Database)
File: caching.pdf

Query for data 
from 2013-01-01 
to 2013-01-08results for segment 2013-01-01/2013-01-02
results for segment 2013-01-02/2013-01-03
results for segment 2013-01-07/2013-01-08Cache (on broker nodes)
segment for data 2013-01-03/2013-01-04
segment for data 2013-01-04/2013-01-05
segment for data 2013-01-05/2013-01-06
segment for data 2013-01-06/2013-01-07Historical and real-time nodes
Query for data 
not in cache
Project: ArangoDB (App Definition and Development / Database)
File: function_output_iterator.pdf

Function Output Iterator
Author : David Abrahams, Jeremy Siek, Thomas Witt
Contact : dave@boost-consulting.com ,jsiek@osl.iu.edu ,witt@ive.uni-hannover.de
Organization :Boost Consulting , Indiana University Open Systems Lab , University of
Hanover Institute for Transport Railway Operation and Construction
Date : 2004-11-01
Copyright : Copyright David Abrahams, Jeremy Siek, and Thomas Witt 2003.
abstract: The function output iterator adaptor makes it easier to create custom output
iterators. The adaptor takes a unary function and creates a model of Output Itera-
tor. Each item assigned to the output iterator is passed as an argument to the unary
function. The motivation for this iterator is that creating a conforming output iterator
is non-trivial, particularly because the proper implementation usually requires a proxy
object.
Table of Contents
Header
function_output_iterator requirements
function_output_iterator models
function_output_iterator operations
Example
Header
#include <boost/function_output_iterator.hpp>
template <class UnaryFunction>
class function_output_iterator {
public:
typedef std::output_iterator_tag iterator_category;
typedef void value_type;
typedef void difference_type;
typedef void pointer;
typedef void reference;
explicit function_output_iterator();
explicit function_output_iterator(const UnaryFunction& f);
/* see below */ operator*();
1function_output_iterator& operator++();
function_output_iterator& operator++(int);
private:
UnaryFunction m_f; // exposition only
};
function_output_iterator requirements
UnaryFunction must be Assignable and Copy Constructible.
function_output_iterator models
function_output_iterator is a model of the Writable and Incrementable Iterator concepts.
function_output_iterator operations
explicit function_output_iterator(const UnaryFunction& f = UnaryFunction());
Eﬀects: Constructs an instance of function_output_iterator with m_fconstructed from
f.
operator*();
Returns: An object rof unspeciﬁed type such that r = t is equivalent to m_f(t) for all
t.
function_output_iterator& operator++();
Returns: *this
function_output_iterator& operator++(int);
Returns: *this
Example
struct string_appender
{
string_appender(std::string& s)
: m_str(&s)
{}
void operator()(const std::string& x) const
{
*m_str += x;
}
std::string* m_str;
};
int main(int, char*[])
{
2std::vector<std::string> x;
x.push_back("hello");
x.push_back(" ");
x.push_back("world");
x.push_back("!");
std::string s = "";
std::copy(x.begin(), x.end(),
boost::make_function_output_iterator(string_appender(s)));
std::cout << s << std::endl;
return 0;
}
3
Project: Druid (App Definition and Development / Database)
File: realtime_flow.pdf

event_23312
event_23481
event_23593
...
event_1234
event_2345
...event_3456
event_4567
...
event_5678
event_6789
...event_7890
event_8901
...Disk and persisted indexesHeap and in-memory index
Persistevent_34982
event_35789
event_36791
...
event_1234
event_2345
...event_3456
event_4567
...
event_5678
event_6789
...event_7890
event_8901
...Off-heap memory and 
persisted indexes
LoadQueries