{"issue":{"state":"open","pull_request":{"diff_url":null,"html_url":null,"patch_url":null},"milestone":{"state":"open","open_issues":20,"url":"https://api.github.com/repos/filipg/amu_automata_2011/milestones/6","due_on":"2011-11-09T08:00:00Z","title":"zajęcia VII","description":"","number":6,"creator":{"avatar_url":"https://secure.gravatar.com/avatar/3eae35237b5c224a29148e6debacb5f9?d=https://a248.e.akamai.net/assets.github.com%2Fimages%2Fgravatars%2Fgravatar-140.png","gravatar_id":"3eae35237b5c224a29148e6debacb5f9","url":"https://api.github.com/users/filipg","login":"filipg","id":1055241},"closed_issues":0,"created_at":"2011-10-19T07:31:33Z"},"user":{"avatar_url":"https://secure.gravatar.com/avatar/3eae35237b5c224a29148e6debacb5f9?d=https://a248.e.akamai.net/assets.github.com%2Fimages%2Fgravatars%2Fgravatar-140.png","gravatar_id":"3eae35237b5c224a29148e6debacb5f9","url":"https://api.github.com/users/filipg","login":"filipg","id":1055241},"assignee":null,"updated_at":"2011-11-14T19:21:41Z","labels":[{"name":"6 punktów","color":"ededed","url":"https://api.github.com/repos/filipg/amu_automata_2011/labels/6+punkt%C3%B3w"},{"name":"assigned","color":"02e10c","url":"https://api.github.com/repos/filipg/amu_automata_2011/labels/assigned"},{"name":"tester-assigned","color":"02e10c","url":"https://api.github.com/repos/filipg/amu_automata_2011/labels/tester-assigned"}],"closed_at":null,"comments":16,"url":"https://api.github.com/repos/filipg/amu_automata_2011/issues/126","body":"Należy opracować metodę (może być w osobnej klasie, powiedzmy, `DeterministicUtilities`):\r\n\r\n    /**\r\n     * Tworzy automat deterministyczny, który akceptuje napisy ze zbioru `language` i nie akceptuje żadnych innych napisów. \r\n     * Automat powinien powstać przez rozbudowanie pustego automatu deterministycznego przekazanego jako argument `automaton`.\r\n     */\r\n    void createAutomatonForFiniteLanguage(DeterministicAutomatonSpecification automaton, Set<String> language);\r\n\r\n","html_url":"https://github.com/filipg/amu_automata_2011/issues/126","title":"Napisać metodę, która tworzy automat akceptujący podany język skończony","number":126,"id":2031344,"created_at":"2011-10-24T08:14:38Z"},"action":"created","comment":{"user":{"avatar_url":"https://secure.gravatar.com/avatar/89e2548fe8a55512dd8b88b76e8e6e74?d=https://a248.e.akamai.net/assets.github.com%2Fimages%2Fgravatars%2Fgravatar-140.png","gravatar_id":"89e2548fe8a55512dd8b88b76e8e6e74","url":"https://api.github.com/users/Drzejzi","login":"Drzejzi","id":1084300},"updated_at":"2011-11-14T19:21:41Z","url":"https://api.github.com/repos/filipg/amu_automata_2011/issues/comments/2735128","body":"Hm. Ten if jest w pętli i gdyby dodać do niego else'a, blok 35-40 wykonywałby się w prawie każdym przebiegu pętli, a w zamierzeniu program ma w niego wejść kiedy przejdzie przez całą pętlę i nie wejdzie w żadnego ifa.","id":2735128,"created_at":"2011-11-14T19:21:41Z"}}