{"type":"rich","url":"https://zroff.hatenadiary.org/entry/20090108/1231448281","blog_url":"https://zroff.hatenadiary.org/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fzroff.hatenadiary.org%2Fentry%2F20090108%2F1231448281\" title=\"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0 C\u8a00\u8a9e\u3000\u5fa9\u7fd2\u3000\u69cb\u9020\u4f53\u3000\u5171\u7528\u4f53 offsetof - w\u3092\u3057\u3066\u3082\u4e00\u4eba \" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0","author_url":"https://blog.hatena.ne.jp/zroff/","height":"190","published":"2009-01-08 05:58:01","width":"100%","description":"offsetof\u30de\u30af\u30ed\u306e\u5b58\u5728\u3092\u77e5\u308b\u3002 #include <stdio.h> #include <stddef.h> typedef enum { OP_CHAR, OP_CONCAT, OP_ALTER, OP_CLOSURE, OP_NULL } Op_t; typedef struct Tree { Op_t Op; union { char c; struct { struct Tree *_left; struct Tree *_right; }X; }U; }Tree_t; int main(void) { Tree_t t; printf(\"t=%d,op=%d,o_op=%d,U\u2026","author_name":"zroff","title":"\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0 C\u8a00\u8a9e\u3000\u5fa9\u7fd2\u3000\u69cb\u9020\u4f53\u3000\u5171\u7528\u4f53 offsetof","image_url":null,"categories":[],"provider_name":"Hatena Blog","blog_title":"w\u3092\u3057\u3066\u3082\u4e00\u4eba ","provider_url":"https://hatena.blog"}