{"url":"https://fjnl.hatenadiary.org/entry/20100615/1276611443","width":"100%","blog_url":"https://fjnl.hatenadiary.org/","blog_title":"fjnl\u306e\u751f\u5b58\u8a18\u9332\u306e\u3088\u3046\u306a\u4f55\u304b","description":"C++\u3067\u306fOpenMP\u3088\u308a\u3082\u3001std algorithm\u304c\u4e26\u5217\u306b\u52d5\u3044\u305f\u65b9\u304c\u4fbf\u5229\u3060\u3088\u306d\u3002\u3068\u3044\u3046\u3053\u3068\u3067\u4f5c\u308a\u307e\u3057\u305f\u3002\u5143\u30cd\u30bf\u306fhttps://twitter.com/cpp_akira/status/16195866927\u3067\u3059\u3002 #ifdef _OPENMP inline size_t concurrency_omp() { size_t n; #pragma omp parallel { n = omp_get_num_threads(); } return n; } #endif inline size_t concurrency() { #ifdef _OPENMP static size_t \u2026","height":"190","type":"rich","published":"2010-06-15 23:17:23","categories":["C++"],"author_url":"https://blog.hatena.ne.jp/fjnl/","version":"1.0","title":"std::async\u306b\u3088\u308b\u4e26\u5217for_each","image_url":null,"provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ffjnl.hatenadiary.org%2Fentry%2F20100615%2F1276611443\" title=\"std::async\u306b\u3088\u308b\u4e26\u5217for_each - fjnl\u306e\u751f\u5b58\u8a18\u9332\u306e\u3088\u3046\u306a\u4f55\u304b\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","author_name":"fjnl"}