{"title":"\u3010Unity\u3011\u30ed\u30fc\u30ab\u30eb\u5ea7\u6a19\u306e\u8ddd\u96e2\u304c\u4e00\u756a\u8fd1\u3044\u30b3\u30f3\u30dd\u30fc\u30cd\u30f3\u30c8\u3092\u691c\u7d22\u3057\u3066\u8fd4\u3059\u62e1\u5f35\u30e1\u30bd\u30c3\u30c9","blog_url":"https://baba-s.hatenablog.com/","image_url":null,"categories":[],"url":"https://baba-s.hatenablog.com/entry/2024/03/08/153320","description":"\u30bd\u30fc\u30b9\u30b3\u30fc\u30c9 /// <summary> /// \u30ed\u30fc\u30ab\u30eb\u5ea7\u6a19\u306e\u8ddd\u96e2\u304c\u4e00\u756a\u8fd1\u3044\u30b3\u30f3\u30dd\u30fc\u30cd\u30f3\u30c8\u3092\u691c\u7d22\u3057\u3066\u8fd4\u3057\u307e\u3059 /// </summary> public static T2 FindClosestByLocalPosition<T1, T2> ( this IReadOnlyList<T2> self, T1 component, float maxDistance ) where T1 : Component where T2 : Component { T2 closestComponent = null; var closestDistance = Mathf.Infinity; fo\u2026","height":"190","version":"1.0","published":"2024-03-08 15:33:20","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fbaba-s.hatenablog.com%2Fentry%2F2024%2F03%2F08%2F153320\" title=\"\u3010Unity\u3011\u30ed\u30fc\u30ab\u30eb\u5ea7\u6a19\u306e\u8ddd\u96e2\u304c\u4e00\u756a\u8fd1\u3044\u30b3\u30f3\u30dd\u30fc\u30cd\u30f3\u30c8\u3092\u691c\u7d22\u3057\u3066\u8fd4\u3059\u62e1\u5f35\u30e1\u30bd\u30c3\u30c9 - \u30b3\u30ac\u30cd\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"\u30b3\u30ac\u30cd\u30d6\u30ed\u30b0","author_name":"baba_s","provider_url":"https://hatena.blog","type":"rich","author_url":"https://blog.hatena.ne.jp/baba_s/","width":"100%","provider_name":"Hatena Blog"}