<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>kenta11626918</author_name>
  <author_url>https://blog.hatena.ne.jp/kenta11626918/</author_url>
  <blog_title>Set::prototype</blog_title>
  <blog_url>https://kenta11626918.hatenadiary.org/</blog_url>
  <categories>
    <anon>自作関数</anon>
    <anon>C++</anon>
    <anon>テンプレート</anon>
  </categories>
  <description>namespace MyArray { //[begin, end)の範囲での配列の最小値のインデックスを求める template int ArrayMinIndex(TYPE* array, int begin, int end) { int min = begin; //return for(int i = begin+1; i array[i]) { min = i; } } return min; } //[begin, end)の範囲での配列の最大値のインデックスを求める template int ArrayMaxIndex(TYPE* array, int begin, int e…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fkenta11626918.hatenadiary.org%2Fentry%2F20110403%2F1301794699&quot; title=&quot;配列群 MyArray - Set::prototype&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2011-04-03 10:38:19</published>
  <title>配列群 MyArray</title>
  <type>rich</type>
  <url>https://kenta11626918.hatenadiary.org/entry/20110403/1301794699</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
