[B! boost] ttakezawaã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ttakezawa id:ttakezawa

boostã«é–¢ã™ã‚‹ttakezawaã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (9)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Boost.å‹‰å¼·ä¼š #4 ã§ç™ºè¡¨ã—ã¦ãã¾ã—ãŸ - ç´”ç²‹é–¢æ•°åž‹é›‘è¨˜å¸³
Boost.å‹‰å¼·ä¼š #4ã§ç™ºè¡¨ã—ã¦ãã¾ã—ãŸã€‚ICFP Programming Contest 2010 ã§ã® Discriminating Hacker's è¨€èªžã®ä»¶ã‹ã‚‰ã€ C++ã‚’DISã‚‹ã¨ã„ã†ãƒ†ãƒ¼ãƒžã§è©±ã™æ©Ÿä¼šã‚’é ‚ã„ãŸã®ã§ã€ã›ã£ã‹ããªã®ã§ã€ç™ºè¡¨ã•ã›ã¦ã„ãŸã ãã“ã¨ã«ã—ã¾ã—ãŸã€‚ C++ã‚³ãƒŸãƒ¥ãƒ‹ãƒ†ã‚£ãƒ¼ã®ä¸å¿ƒã§C++ã‚’DISã‚‹ View more presentations from tanakh C++ãƒ—ãƒã‚°ãƒ©ãƒžã€æ‰€è¬‚é—‡ã®è»å›£ã®é›†ã†ä¸ã§ã“ã®ã‚ˆã†ãªç™ºè¡¨ã‚’ã™ã‚‹ã®ã¯ã€ã¾ã•ã«é£›ã‚“ã§ç«ã«å…¥ã‚‹å¤ã®è™«ã¨ã„ã†ã‚„ã¤ã§ã€æˆ¦ã€…æã€…ã¨ã—ã¦ã„ãŸã®ã§ã™ãŒã€æ€æƒ‘ã¨ã¯é€†ã«ã€å…¨ç„¶DISã‚Œã¦ã„ãªã„ã¨ç§ãŒDISã‚‰ã‚Œã‚‹ã¨ã„ã†ã‚ˆã†ãªçµæžœã¨ãªã‚Šã¾ã—ãŸã€‚ Haskellerã®ç›®ç·šã‹ã‚‰ã€C++ã®æ°—ã«å…¥ã‚‰ãªã„ç‚¹ã‚’ã€ä¸»ã«åž‹ã®è©±ã‚’ãƒ¡ã‚¤ãƒ³ã«å±•é–‹ã—ã¦ã„ã£ãŸã®ã§ã™ãŒã€ãŠãŠã‚ˆãã®C++erã«ã¨ã£ã¦ã¯ã‚ã¾ã‚Šè³›å¦ä¸¡è«–ã¨ã¯è¨€ãˆãªã‹ã£ãŸã‚ˆã†ã§ã™ãã€‚ãªã‚“ã§ã—ã‚‡ã†ã‹
ttakezawa 2011/12/10
c++ã®ãã‚‚ã„ã¨ã“ã‚ã®æ¦‚è¦

c++

boost

haskell
ãƒªãƒ³ã‚¯
Boostå‹‰å¼·ä¼š - ã¯ã¦ãªã‹ã‚ˆã£ï¼
http://atnd.org/events/1839 LTè¾ºã‚Šã§ç™ºè¡¨ã—ãŸã‹ã£ãŸã‘ã©ã‚‚ï¼Œå‚åŠ ãŒé›£ã—ãUstã§è¦‹ã¦ãŸï¼Žã©ã‚Œã‚‚æ¿ƒã„è©±ã ã£ãŸã‘ã©ã‚‚ï¼Œshared_ptrã®è©±ã¯ãã‚“ãªã®æ„è˜ã›ãšã«éŽåŽ»ä½¿ã£ã¦ã—ã¾ã£ã¦ã™ã„ã¾ã›ã‚“ï¼Œã¨ã„ã†ãã‚‰ã„ç´ æ™´ã‚‰ã—ã„è©±ã ã£ãŸã®ã§ï¼ŒC++erã¯æ˜¯éžè¦‹ã¾ã—ã‚‡ã†ï¼Ž Dè¨€èªžã¨Boost C++ã«å½±éŸ¿ã‚’å—ã‘ã¦ã„ã¦ã‹ã¤AndreiãŒã„ã‚‹ã‚ã‘ã§ï¼Œã„ãã¤ã‹è¢«ã£ã¦ã„ã‚‹æ‰€ãŒã‚ã‚‹ã®ã§ï¼ŒDè¨€èªžã¨ã®å¯¾å¿œã‚’å¤§é›‘æŠŠã«æ›¸ã„ã¦ã¿ã‚‹(å®Œå…¨ã«åŒã˜ã“ã¨ãŒã§ãã‚‹ã¨ã‹ã˜ã‚ƒãªã„ã®ã§ã‚ãã¾ã§ç›®å®‰ï¼ŽBoostã®ç†è§£ãŒè¶³ã‚Šãªã„ã®ã§é–“é•ã£ã¦ãŸã‚‰ã™ã„ã¾ã›ã‚“)ï¼Ž Any std.variant.Variantï¼Ž Bind std.bindï¼Žã§ã‚‚D2ã ã¨å£Šã‚Œã¦ã‚‹æ°—ãŒã™ã‚‹ã®ã§ï¼Œæœ‰åŠ¹æ´»ç”¨ã™ã‚‹ãªã‚‰D1ã‹ãªï¼Ž Concept Check concept if + is(typeof({}))ã‹ãªï¼Ÿä»Šå¾Œmetaã«ãªã‚Šãã†ã ã‘ã©ï¼Ž Con
ttakezawa 2009/12/13
dè¨€èªž

boost

c++

library
ãƒªãƒ³ã‚¯
Serialization - BOOST_STATIC_WARNING
Motivation typedef creates an alias for an existing type. It does not create a new type that can be used for matching either function or template parameters. This can be shown by trying to compile the following example. typedef int a; void f(int x); // (1) function to handle simple integers void f(a x); // (2) special function to handle integers of type a int main(){ int x = 1; a y; y = x; // othe
ttakezawa 2009/12/12
c++

library

boost
ãƒªãƒ³ã‚¯
Boost Polygon Library: Main Page
THE BOOST.POLYGON LIBRARY The Boost.Polygon library provides algorithms focused on manipulating planar polygon geometry data.Â Specific algorithms provided are the polygon set operations (intersection, union, difference, disjoint-union) and related algorithms such as polygon connectivity graph extraction, offsetting and map-overlay. An example of the disjoint-union (XOR) of figure a and figure b i
ttakezawa 2009/12/12
boost

library

c++
ãƒªãƒ³ã‚¯
artima - Conditional Love: FOREACH Redux
Plowing through some devilish details of template argument deduction, the conditional operator and the macro preprocessor, Eric develops a robust FOR_EACH iterator. Whether you're using arrays, strings, or containers, this one does it all. Conditional Love: FOREACH Redux My CS201 "Software Development Methods" professor taught that all anyone would ever need to know about C++'s ternary conditional
ttakezawa 2008/11/18
?++

c++

boost

library
ãƒªãƒ³ã‚¯
letsboost::statechart
sample ã‚µãƒ³ãƒ—ãƒ«ã®å‹•ä½œç¢ºèªãƒãƒ¼ã‚¸ãƒ§ãƒ³ [GCC4.4/1.41.0] [VC9/1.41.0] ã€ŒState Map Compilerã€ã¨ã„ã†è¨˜äº‹ã®ä¾‹ã‚’Boost.Statechartã§æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ ã€ŒãŠé‡‘ã‚’å…¥ã‚ŒãŸã‚‰ä¸€äººã ã‘é€šéŽã§ãã‚‹é–€ã€ã‚’å®Ÿè£…ã—ã¾ã—ã‚‡ã†ã¨ã„ã†ãŠé¡Œã§â€¦ é–€ã«ã¯ã€Œé€šéŽã—ã¦OKï¼ˆUnlockedï¼‰ã€ãªçŠ¶æ…‹ã¨ã€Œé€šéŽã—ã¡ã‚ƒã ã‚ï¼ˆLockedï¼‰ã€ã®ï¼’ã¤ã®çŠ¶æ…‹ãŒã‚ã‚Šã¾ã™ã€‚ LockedçŠ¶æ…‹ã§ãŠé‡‘ã‚’å…¥ã‚Œã‚‹(Coin)ã¨UnlockedçŠ¶æ…‹ã«ç§»ã£ã¦ã€é€†ã«ã€UnlockedçŠ¶æ…‹ã§äººãŒä¸€äººé€šã‚‹(Pass)ã¨ã€ LockedçŠ¶æ…‹ã«ç§»ã‚Šã¾ã™ã€‚LockedçŠ¶æ…‹ãªã®ã«å¼·è¡Œçªç ´ã™ã‚‹ãƒã‚«è€…ãŒã„ã‚‹(Pass)ã¨ã€Alarmã‚¢ã‚¯ã‚·ãƒ§ãƒ³ã‚’å®Ÿè¡Œã€‚ UnlockedçŠ¶æ…‹ã§ã•ã‚‰ã«ãŠé‡‘ã‚’å…¥ã‚Œã¦ãã‚Œã‚‹äººãŒã„ãŸã‚‰æ„Ÿè¬ã—ã¾ã™(Thankyou)ã€‚ #include <iostream> #include <boos
ttakezawa 2008/11/17
c++

boost

library

statemachine
ãƒªãƒ³ã‚¯
Graph: Boost: ç¯ ç”°åç¥
C++ ç”¨ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªï¼Žæ±Žç”¨çš„ãªãƒ©ã‚¤ãƒ–ãƒ©ãƒªã®å°‘ãªã‹ã£ãŸï¼Ÿ C++ ã«ã¨ã£ã¦ï¼Œã“ã‚Œã®ãŠã‹ã’ã§é–‹ç™ºãŒã—ã‚„ã™ããªã£ãŸã¨ã„ã£ã¦ã‚‚éŽè¨€ã§ã¯ãªã„ï¼ŽãŸã¶ã‚“ï¼Žã“ã“ã§ã¯Boostã«é–¢ã™ã‚‹è©³ã—ã„èª¬æ˜Žã¯çœãã®ã§ï¼Œä¸‹è¨˜ã®å‚è€ƒæ›¸ãªã©ã‚’å‚è€ƒã«ã—ã¦ã‚‚ã‚‰ã„ãŸã„ï¼Ž æœ¬ãƒšãƒ¼ã‚¸ã§ã¯ï¼ŒBoostã‚’ç”¨ã„ãŸãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®ä¸å¿ƒæ€§ã®è¨ˆç®—ã‚’æ–¹æ³•ã«ã¤ã„ã¦èª¬æ˜Žã™ã‚‹ï¼Ž ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®ä¸å¿ƒæ€§ã¨ã¯ï¼Œã‚ã‚‹è¦ç´ é›†åˆã¨ï¼Œå€‹ã€…ã®è¦ç´ é–“ã®é–¢ä¿‚æ€§ã‹ã‚‰æ§‹æˆã•ã‚Œã‚‹ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«ãŠã„ã¦ï¼Œãã®ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«ãŠã‘ã‚‹å„è¦ç´ ã®é‡è¦æ€§ã‚’ç¤ºã™æŒ‡æ¨™ã¨ã—ã¦ï¼Œæ§˜ã€…ãªã‚‚ã®ãŒæç¤ºã•ã‚Œã¦ã„ã‚‹ï¼Žã“ã®ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®ä¸å¿ƒæ€§ã¯ï¼Œãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯åˆ†æžã‚„è¤‡é›‘ç³»ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«ãŠã„ã¦é‡è¦ãªè¦ç´ ã§ã‚ã‚‹ãŒï¼Œç§è‡ªèº«ãŒå§‹ã‚ãŸå½“æ™‚ï¼Œå¤§è¦æ¨¡ãªãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã‚’å¯¾è±¡ã¨ã—ãŸãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚„ãƒ„ãƒ¼ãƒ«ã¯æä¾›ã•ã‚Œã¦ã„ãªã‹ã£ãŸï¼Žãã“ã§ï¼Œå®Ÿéš›ã«ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ãƒ‡ãƒ¼ã‚¿ã‚’ãƒ—ãƒã‚°ãƒ©ãƒ ã§æ‰±ãŠã†ã¨ä½œæˆã—ã¯ã˜ã‚ã¦è¦‹ãŸã¨ã“ã‚ï¼Œãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚„ç®¡ç†ï¼ŒæŽ¢ç´¢ãªã©çµæ§‹é¢å€’ã§
ttakezawa 2008/11/14
c++

algorithm

boost

graph

library
ãƒªãƒ³ã‚¯
http://www.amazon.co.jp/Boost-C-%E3%82%92%E3%83%81%E3%83%A5%E3%83%BC%E3%83%B3%E3%82%A2%E3%83%83%E3%83%97%E3%81%99%E3%82%8B%E6%9C%80%E5%85%88%E7%AB%AF%E3%83%A9%E3%82%A4%E3%83%96%E3%83%A9%E3%83%AA-%E3%83%93%E3%83%A7%E3%83%AB%E3%83%B3%E3%83%BB%E3%82%AB%E3%83
ttakezawa 2008/11/14
c++

boost

book

amazon
ãƒªãƒ³ã‚¯
Table of Contents: Boost Graph Library(BGL)
ç›®æ¬¡: the Boost Graph Library BGL ã¸ã®åºç« æ´å² åˆŠè¡Œç‰© è¬è¾ž ã‚¯ã‚¤ãƒƒã‚¯ãƒ»ãƒ„ã‚¢ãƒ¼ åŸºæœ¬çš„ãªã‚°ãƒ©ãƒ•ç†è«–ã®å¾©ç¿’ ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ« Property Maps The adjacency_list class ä¾‹é¡Œ ãƒ•ã‚¡ã‚¤ãƒ«ä¾å˜é–¢ä¿‚ã®ä¾‹ Kevin Bacon ã®ï¼–æ¬¡æ•° Graph Coloring Sparse Matrix Ordering BGL æ‹¡å¼µ Constructing graph algorithms with BGL Converting Existing Graphs to BGL Boost Graph ã‚¤ãƒ³ã‚¿ãƒ•ã‚§ã‚¤ã‚¹ Graph Incidence Graph Bidirectional Graph Adjacency Graph Vertex List Graph Edge List Graph Vertex and Edge List Gr
ttakezawa 2008/11/13
c++

boost

graph

library

algorithm
ãƒªãƒ³ã‚¯
1