|
|---|
| Now when he had ended all his sayings in the audience of the people, he entered into Capernaum.
|
|---|
| ᎿᎭᏉᏃ ᎤᏍᏆᏛ ᏂᎦᏛ ᎦᏬᏂᏍᎬ ᎠᎾᏛᎩᏍᎬ ᏴᏫ, ᎨᏆᏂ ᏭᏴᎴᎢ.
|
|---|
Hna-quo-no u-s-qua-dv ni-ga-dv ga-wo-ni-s-gv a-na-dv-gi-s-gv yv-wi, Ge-qua-ni wu-yv-le-i.
|
|---|
|
|---|
| And a certain centurion's servant, who was dear unto him, was sick, and ready to die.
|
|---|
| ᎩᎶᏃ ᎢᏳᏍᏗ ᎠᏍᎪᎯᏧᏈ ᎠᏂᏯᏫᏍᎩ ᏗᏖᏂᏙᎯ ᎤᏅᏏᏓᏍᏗ, ᎣᏍᏛ ᎤᏰᎸᎯ, ᎤᏢᎨᎢ, ᎠᎴ ᎤᏲᎱᏏᏕᎾ ᎨᏎᎢ.
|
|---|
Gi-lo-no i-yu-s-di a-s-go-hi-tsu-qui a-ni-ya-wi-s-gi di-te-ni-do-hi u-nv-si-da-s-di, o-s-dv u-ye-lv-hi, u-tlv-ge-i, a-le u-yo-hu-si-de-na ge-se-i.
|
|---|
|
|---|
| And when he heard of Jesus, he sent unto him the elders of the Jews, beseeching him that he would come and heal his servant.
|
|---|
| ᏥᏌᏃ ᎠᏥᏃᎮᏍᎬ ᎤᏛᎦᏅ, ᏚᏅᏎ ᏤᏙᎲ ᏗᏂᎳᏫᎩ ᎠᏂᏧᏏ ᏧᎾᏤᎵᎦ, ᏭᏔᏲᏎᎮ ᏅᏓᏳᏪᏅᏍᏗᏱ ᎤᏅᏬᏗᏱ ᎤᏅᏏᏗᏍᏗ.
|
|---|
Tsi-sa-no a-tsi-no-he-s-gv u-dv-ga-nv, du-nv-se tse-do-hv di-ni-la-wi-gi A-ni-tsu-si tsu-na-tse-li-ga, wu-ta-yo-se-he nv-da-yu-we-nv-s-di-yi u-nv-wo-di-yi u-nv-si-di-s-di.
|
|---|
|
|---|
| And when they came to Jesus, they besought him instantly, saying, That he was worthy for whom he should do this:
|
|---|
| ᏥᏌᏃ ᎬᏩᎷᏤᎸ, ᎤᏣᏘ ᎬᏩᏍᏗ ᏰᏔᏁᎢ, ᎯᎠ ᎾᏂᏪᏍᎨᎢ; ᎤᏓᏅᏘᏳ ᎾᏍᎩ ᎯᎠ ᏥᏅᏘᏯᏛᏁᎵ;
|
|---|
Tsi-sa-no gv-wa-lu-tse-lv, u-tsa-ti gv-wa-s-di ye-ta-ne-i, hi-a na-ni-we-s-ge-i; U-da-nv-ti-yu na-s-gi hi-a tsi-nv-ti-ya-dv-ne-li;
|
|---|
|
|---|
| For he loveth our nation, and he hath built us a synagogue.
|
|---|
| ᎤᎨᏳᎯᏳᏰᏃ ᎢᎩᏠᏱ ᎨᏒ ᏴᏫ, ᎠᎴ ᎢᎦᏁᏍᎨᎸ ᏗᎩᎳᏫᎢᏍᏗᏱ.
|
|---|
U-ge-yu-hi-yu-ye-no i-gi-tlo-yi ge-sv yv-wi, a-le i-ga-ne-s-ge-lv di-gi-la-wi-i-s-di-yi.
|
|---|
|
|---|
| Then Jesus went with them. And when he was now not far from the house, the centurion sent friends to him, saying unto him, Lord, trouble not thyself: for I am not worthy that thou shouldest enter under my roof:
|
|---|
| ᏥᏌᏃ ᏚᏍᏓᏩᏛᏎᎢ. ᎿᎭᏉᏃ ᎾᎥᏉ ᎤᎷᎴ ᏗᏓᏁᎸ, ᎠᏍᎪᎯᏧᏈ ᎠᏂᏯᏫᏍᎩ ᏗᏘᏂᏙᎯ ᏙᏧᏅᏎ ᏧᎵᎢ ᏂᏙᏓᎬᏩᏠᎯᏍᏗᏱ, ᎯᎠ ᏅᏧᏪᏎᎴᎢ; ᏣᎬᏫᏳᎯ, ᏞᏍᏗ ᏨᏒ ᏣᏓᏕᏯᏙᏔᏅᎩ; ᎥᏝᏰᏃ ᏰᎵ ᏱᏂᎪᎯ ᏣᏴᏍᏗᏱ ᏥᏁᎸᎢ ᏥᎾᏆᏍᏗᏉ;
|
|---|
Tsi-sa-no du-s-da-wa-dv-se-i. Hna-quo-no na-v-quo u-lu-le di-da-ne-lv, a-s-go-hi-tsu-qui a-ni-ya-wi-s-gi di-ti-ni-do-hi do-tsu-nv-se tsu-li-i ni-do-da-gv-wa-tlo-hi-s-di-yi, hi-a nv-tsu-we-se-le-i; Tsa-gv-wi-yu-hi, tle-s-di tsv-sv tsa-da-de-ya-do-ta-nv-gi; v-tla-ye-no ye-li yi-ni-go-hi tsa-yv-s-di-yi tsi-ne-lv-i tsi-na-qua-s-di-quo;
|
|---|
|
|---|
| Wherefore neither thought I myself worthy to come unto thee: but say in a word, and my servant shall be healed.
|
|---|
| ᎥᏝ ᎠᎴ ᎾᏍᏉ ᏰᎵ ᏂᎪᎢ ᏱᏇᎵᏎ ᏫᎬᎷᏤᏗᏱ; ᎯᏁᎩᏉᏍᎩᏂ, ᏥᏅᏏᏓᏍᏗᏃ ᏧᏳᏗᏩᏏ.
|
|---|
V-tla a-le na-s-quo ye-li ni-go-i yi-que-li-se wi-gv-lu-tse-di-yi; hi-ne-gi-quo-s-gi-ni, tsi-nv-si-da-s-di-no tsu-yu-di-wa-si.
|
|---|
|
|---|
| For I also am a man set under authority, having under me soldiers, and I say unto one, Go, and he goeth; and to another, Come, and he cometh; and to my servant, Do this, and he doeth it.
|
|---|
| ᎠᏴᏰᏃ ᎾᏍᏉ ᏗᏆᏓᏁᎶᏗᏉ, ᎠᎴ ᏗᎩᎧᎭ ᎠᏂᏯᏫᏍᎩ ᎠᎴ ᎠᏴ ᏕᎬᏆᏁᎶᏙᎢ, ᎩᎶᏃ ᎮᎾ ᏥᏲᏏ, ᎡᎪᎢ; ᏅᏩᏓᎴᏃ ᎡᎮᎾ ᏥᏲᏏ, ᏗᎡᎪᎢ; ᏥᏅᏏᏓᏍᏗᏃ ᎯᎠ ᎿᎭᏛᎦ ᏥᏲᏏ, ᎾᏍᎩ ᎾᏛᏁᎰᎢ.
|
|---|
A-yv-ye-no na-s-quo di-qua-da-ne-lo-di-quo, a-le di-gi-ka-ha a-ni-ya-wi-s-gi a-le a-yv de-gv-qua-ne-lo-do-i, gi-lo-no He-na tsi-yo-si, e-go-i; nv-wa-da-le-no E-he-na tsi-yo-si, di-e-go-i; tsi-nv-si-da-s-di-no Hi-a hna-dv-ga tsi-yo-si, na-s-gi na-dv-ne-ho-i.
|
|---|
|
|---|
| When Jesus heard these things, he marvelled at him, and turned him about, and said unto the people that followed him, I say unto you, I have not found so great faith, no, not in Israel.
|
|---|
| ᏥᏌᏃ ᎾᏍᎩ ᎯᎠ ᎤᏛᎦᏅ, ᎤᏍᏆᏂᎪᏎᎴᎢ, ᎠᎴ ᎤᎦᏔᎲᏎᎢ, ᎠᎴ ᎯᎠ ᏂᏚᏪᏎᎵ ᏴᏫ ᎾᏍᎩ ᏅᏓᎬᏩᏍᏓᏩᏛᏛ; ᎯᎠ ᏂᏨᏪᏎᎭ; ᎥᏝ ᎾᏍᏉ ᎢᏏᎵ ᎠᏁᎲ ᎾᏍᎩ ᎢᎦᎢ ᎪᎯᏳᏗ ᎨᏒ ᏯᎩᏩᏛᎲ.
|
|---|
Tsi-sa-no na-s-gi hi-a u-dv-ga-nv, u-s-qua-ni-go-se-le-i, a-le u-ga-ta-hv-se-i, a-le hi-a ni-du-we-se-li yv-wi na-s-gi nv-da-gv-wa-s-da-wa-dv-dv; hi-a ni-tsv-we-se-ha; V-tla na-s-quo I-si-li a-ne-hv na-s-gi i-ga-i go-hi-yu-di ge-sv ya-gi-wa-dv-hv.
|
|---|
|
|---|
| And they that were sent, returning to the house, found the servant whole that had been sick.
|
|---|
| ᎾᏍᎩᏃ Ꮎ ᏅᏓᎨᏥᏅᏏᏛ, ᏫᎤᏂᎷᏨ ᏗᏓᏁᎸ, ᎠᏥᏅᏏᏓᏍᏗ ᎤᏢᏨᎯ ᎤᏂᏩᏛᎮ ᎤᏗᏩᏒᎯ ᎢᎨᏎᎢ.
|
|---|
Na-s-gi-no na nv-da-ge-tsi-nv-si-dv, wi-u-ni-lu-tsv di-da-ne-lv, a-tsi-nv-si-da-s-di u-tlv-tsv-hi u-ni-wa-dv-he u-di-wa-sv-hi i-ge-se-i.
|
|---|
|
|---|
| And it came to pass the day after, that he went into a city called Nain; and many of his disciples went with him, and much people.
|
|---|
| ᎯᎠᏃ ᏄᎵᏍᏔᏁ ᎤᎩᏨᏛ, ᎾᏍᎩ ᏗᎦᏚᎲ ᎾᏱᏂ ᏧᏙᎢᏛ ᏭᏴᎴᎢ; ᏰᎵᏃ ᎠᏂᎪᏗᏳ ᎬᏩᏍᏓᏩᏗᏙᎯ ᎬᏩᏍᏓᏩᏛᏎᎢ, ᎠᎴ ᎤᏂᏣᏘ ᏴᏫ.
|
|---|
Hi-a-no nu-li-s-ta-ne u-gi-tsv-dv, na-s-gi di-ga-du-hv Na-yi-ni tsu-do-i-dv wu-yv-le-i; ye-li-no a-ni-go-di-yu gv-wa-s-da-wa-di-do-hi gv-wa-s-da-wa-dv-se-i, a-le u-ni-tsa-ti yv-wi.
|
|---|
|
|---|
| Now when he came nigh to the gate of the city, behold, there was a dead man carried out, the only son of his mother, and she was a widow: and much people of the city was with her.
|
|---|
| ᎿᎭᏉᏃ ᎦᎶᎯᏍᏗᏱ ᎪᏢᏒ ᎦᏚᎲ ᎾᎥ ᎤᎷᏨ, ᎬᏂᏳᏉ ᎠᏍᎦᏯ ᎤᏲᎱᏒᎯ ᎠᏂᏄᎪᏫᏍᎨ ᎠᏂᏂᏎᎢ, ᎤᏩᏒᎯᏳ ᎤᏪᏥ ᎨᏎ ᎤᏥ, ᎠᎴ ᎾᏍᎩ ᎤᏬᏑᎶᏨᎯ ᎨᏎᎢ; ᎤᏂᏣᏖᏃ ᏴᏫ ᎦᏚᎲ ᎠᏁᎯ ᎬᏩᏍᏓᏩᏗᏎᎢ.
|
|---|
Hna-quo-no ga-lo-hi-s-di-yi go-tlv-sv ga-du-hv na-v u-lu-tsv, gv-ni-yu-quo a-s-ga-ya u-yo-hu-sv-hi a-ni-nu-go-wi-s-ge a-ni-ni-se-i, u-wa-sv-hi-yu u-we-tsi ge-se u-tsi, a-le na-s-gi u-wo-su-lo-tsv-hi ge-se-i; u-ni-tsa-te-no yv-wi ga-du-hv a-ne-hi gv-wa-s-da-wa-di-se-i.
|
|---|
|
|---|
| And when the Lord saw her, he had compassion on her, and said unto her, Weep not.
|
|---|
| ᎤᎬᏫᏳᎯᏃ ᎤᎪᎲ ᎤᏪᏙᎵᏤᎢ, ᎠᎴ ᎯᎠ ᏄᏪᏎᎴᎢ; ᏞᏍᏗ ᏗᏣᏠᏱᎸᎩ.
|
|---|
U-gv-wi-yu-hi-no u-go-hv u-we-do-li-tse-i, a-le hi-a nu-we-se-le-i; Tle-s-di di-tsa-tlo-yi-lv-gi.
|
|---|
|
|---|
| And he came and touched the bier: and they that bare him stood still. And he said, Young man, I say unto thee, Arise.
|
|---|
| ᎤᎷᏨᏃ ᎤᏏᏔᏕ ᎠᏥᏢᏛᎢ, ᎬᏩᏁᎩᏃ ᎤᎾᎴᎾᏫᏍᏔᏁᎢ. ᎯᎠᏃ ᏄᏪᏎᎢ; ᎯᏫᏅ, ᎭᏗᏛ, ᎬᏲᏎᎭ.
|
|---|
U-lu-tsv-no u-si-ta-de a-tsi-tlv-dv-i, gv-wa-ne-gi-no u-na-le-na-wi-s-ta-ne-i. Hi-a-no nu-we-se-i; Hi-wi-nv, Ha-di-dv, gv-yo-se-ha.
|
|---|
|
|---|
| And he that was dead sat up, and began to speak. And he delivered him to his mother.
|
|---|
| ᎤᏲᎱᏒᎯᏃ ᎤᏗᏛᎮ ᎤᏪᏁᎢ, ᎠᎴ ᎤᎴᏅᎮ ᎤᏬᏂᏎᎢ; ᎤᏥᏃ ᎤᏪᎧᏁᎴᎢ.
|
|---|
U-yo-hu-sv-hi-no u-di-dv-he u-we-ne-i, a-le u-le-nv-he u-wo-ni-se-i; u-tsi-no u-we-ka-ne-le-i.
|
|---|
|
|---|
| And there came a fear on all: and they glorified God, saying, That a great prophet is risen up among us; and, That God hath visited his people.
|
|---|
| ᏂᎦᏛᏃ ᎤᏂᎾᏰᏎᎢ; ᎠᎴ ᎤᏂᎸᏉᏔᏁ ᎤᏁᎳᏅᎯ, ᎯᎠ ᎾᏂᏪᏍᎨᎢ; ᎠᏥᎸᏉᏗ ᎠᏙᎴᎰᏍᎩ ᎦᎾᏄᎪᎩ ᎢᏕᎲᎢ; ᎠᎴ ᎯᎠ; ᎤᏁᎳᏅᎯ ᏓᏩᏛᎯᎦ ᏧᏤᎵ ᏴᏫ.
|
|---|
Ni-ga-dv-no u-ni-na-ye-se-i; a-le u-ni-lv-quo-ta-ne U-ne-la-nv-hi, hi-a na-ni-we-s-ge-i; A-tsi-lv-quo-di a-do-le-ho-s-gi ga-na-nu-go-gi i-de-hv-i; a-le hi-a; U-ne-la-nv-hi da-wa-dv-hi-ga tsu-tse-li yv-wi.
|
|---|
|
|---|
| And this rumour of him went forth throughout all Judaea, and throughout all the region round about.
|
|---|
| ᎾᏍᎩᏃ ᎯᎠ ᎠᏥᏃᎮᏍᎬ ᏧᏗᏱ ᏂᎬᎾᏛ ᏚᏰᎵᏏᏙᎴᎢ, ᎠᎴ ᎾᎿᎭᎬᏩᏚᏫᏛ ᎨᏒᎢ.
|
|---|
Na-s-gi-no hi-a a-tsi-no-he-s-gv Tsu-di-yi ni-gv-na-dv du-ye-li-si-do-le-i, a-le na-hna gv-wa-du-wi-dv ge-sv-i.
|
|---|
|
|---|
| And the disciples of John shewed him of all these things.
|
|---|
| ᏣᏂᏃ ᎬᏩᏍᏓᏩᏗᏙᎯ ᎾᏍᎩ ᎯᎠ ᏂᎦᏛ ᎬᏩᏃᏁᎴᎢ.
|
|---|
Tsa-ni-no gv-wa-s-da-wa-di-do-hi na-s-gi hi-a ni-ga-dv gv-wa-no-ne-le-i.
|
|---|
|
|---|
| And John calling unto him two of his disciples sent them to Jesus, saying, Art thou he that should come? or look we for another?
|
|---|
| ᏣᏂᏃ ᎠᏂᏔᎵ ᎬᏩᏍᏓᏩᏗᏙᎯ ᏫᏚᏯᏅᎮ ᏥᏌ ᏤᏙᎲ ᏚᏅᏎ ᎯᎠ ᏫᏄᏪᏎᎢ; ᏂᎯᏍᎪ ᎤᎷᎯᏍᏗ ᏥᎩ? ᏥᎪᎨ ᏅᏩᏓᎴ ᎣᏥᎦᏕᏃᎮᏍᏗ?
|
|---|
Tsa-ni-no a-ni-ta-li gv-wa-s-da-wa-di-do-hi wi-du-ya-nv-he Tsi-sa tse-do-hv du-nv-se hi-a wi-nu-we-se-i; Ni-hi-s-go u-lu-hi-s-di tsi-gi? Tsi-go-ge nv-wa-da-le o-tsi-ga-de-no-he-s-di?
|
|---|
|
|---|
| When the men were come unto him, they said, John Baptist hath sent us unto thee, saying, Art thou he that should come? or look we for another?
|
|---|
| ᎠᏂᏍᎦᏯᏃ ᎬᏩᎷᏤᎸ, ᎯᎠ ᏄᏂᏪᏎᎢ; ᏣᏂ ᏗᏓᏬᏍᎩ ᏦᎩᏂᏅᏒ ᎢᏍᏛᎷᏤᏗᏱ, ᎯᎠ ᏅᏗᎦᏪᎭ; ᏂᎯᏍᎪ ᎤᎷᎯᏍᏗ ᏥᎨᏒᎩ? ᏥᎪᎨ ᏅᏩᏓᎴ ᎣᏥᎦᏖᏃᎮᏍᏗ?
|
|---|
A-ni-s-ga-ya-no gv-wa-lu-tse-lv, hi-a nu-ni-we-se-i; Tsa-ni Di-da-wo-s-gi tso-gi-ni-nv-sv i-s-dv-lu-tse-di-yi, hi-a nv-di-ga-we-ha; Ni-hi-s-go u-lu-hi-s-di tsi-ge-sv-gi? Tsi-go-ge nv-wa-da-le o-tsi-ga-te-no-he-s-di?
|
|---|
|
|---|
| And in that same hour he cured many of their infirmities and plagues, and of evil spirits; and unto many that were blind he gave sight.
|
|---|
| ᎾᎯᏳᏉᏃ ᏚᏅᏩᏁ ᎤᏂᏣᏘ ᏚᏂᏢᎬ ᎠᎴ ᎥᏳᎩ ᏚᏂᏱᎵᏙᎲ, ᎠᎴ ᎤᏂᏲᏗᏓᏅᏙ ᎬᏩᏂᏱᎵᏙᎲᎢ; ᎠᎴ ᎤᏂᏣᏘ ᏗᏂᎨᏫ ᎬᏩᏂᎪᏩᏛᏗ ᏄᏩᏁᎴᎢ.
|
|---|
Na-hi-yu-quo-no du-nv-wa-ne u-ni-tsa-ti du-ni-tlv-gv a-le v-yu-gi du-ni-yi-li-do-hv, a-le u-ni-yo-di-da-nv-do gv-wa-ni-yi-li-do-hv-i; a-le u-ni-tsa-ti di-ni-ge-wi gv-wa-ni-go-wa-dv-di nu-wa-ne-le-i.
|
|---|
|
|---|
| Then Jesus answering said unto them, Go your way, and tell John what things ye have seen and heard; how that the blind see, the lame walk, the lepers are cleansed, the deaf hear, the dead are raised, to the poor the gospel is preached.
|
|---|
| ᎿᎭᏉᏃ ᏥᏌ ᎤᏁᏨ ᎯᎠ ᏂᏚᏪᏎᎴᎢ; ᏥᏍᏕᎾ ᎠᎴ ᏣᏂ ᏪᏍᏗᏃᎲᏏ ᏄᏍᏛ ᎢᏍᏗᎪᎲ ᎠᎴ ᏄᏍᏛ ᎢᏍᏓᏛᎦᏅᎢ; ᎾᏍᎩ ᏗᏂᎨᏫ ᎠᏂᎪᏩᏘᏍᎬᎢ, ᏗᏂᏲᎤᎵ ᎠᏁᏙᎲᎢ, ᎠᏓᏰᏍᎩ ᏧᏂᏢᎩ ᎨᏥᏅᎦᎵᏍᎬᎢ, ᏧᏂᎵᎡᏅ ᎠᎾᏛᎩᏍᎬᎢ, ᏧᏂᏲᎱᏒᎯ ᏕᎨᎦᎴᏗᏍᎬᎢ, ᎤᏲᏃ ᎢᏳᎾᏛᎿᎭᏕᎩ ᎣᏍᏛ ᎧᏃᎮᏛ ᎨᎦᎵᏥᏙᏁᎲᎢ.
|
|---|
Hna-quo-no Tsi-sa u-ne-tsv hi-a ni-du-we-se-le-i; Tsi-s-de-na a-le Tsa-ni we-s-di-no-hv-si nu-s-dv i-s-di-go-hv a-le nu-s-dv i-s-da-dv-ga-nv-i; na-s-gi di-ni-ge-wi a-ni-go-wa-ti-s-gv-i, di-ni-yo-u-li a-ne-do-hv-i, a-da-ye-s-gi tsu-ni-tlv-gi ge-tsi-nv-ga-li-s-gv-i, tsu-ni-li-e-nv a-na-dv-gi-s-gv-i, tsu-ni-yo-hu-sv-hi de-ge-ga-le-di-s-gv-i, u-yo-no i-yu-na-dv-hna-de-gi o-s-dv ka-no-he-dv ge-ga-li-tsi-do-ne-hv-i.
|
|---|
|
|---|
| And blessed is he, whosoever shall not be offended in me.
|
|---|
| ᎠᎴ ᎣᏏᏳ ᎢᏳᎵᏍᏓᏁᏗ ᎩᎶ ᎠᏴ ᏂᏗᏥᏲᏕᏍᏗᏍᎬᎾ ᎢᎨᏎᏍᏗ.
|
|---|
A-le o-si-yu i-yu-li-s-da-ne-di gi-lo a-yv ni-di-tsi-yo-de-s-di-s-gv-na i-ge-se-s-di.
|
|---|
|
|---|
| And when the messengers of John were departed, he began to speak unto the people concerning John, What went ye out into the wilderness for to see? A reed shaken with the wind?
|
|---|
| ᎿᎭᏉᏃ ᏣᏂ ᏂᏙᏓᏳᏅᏏᏛ ᎢᎤᏁᏅ, ᎤᎴᏅᎮ ᏣᏂ ᏚᏁᎢᏍᏓᏁᎴ ᏴᏫ; ᎦᏙ ᎢᏣᎦᏔᏅᏎ ᎢᎾᎨᎢ? ᏩᏐᎾᏍᎪ ᎤᏃᎴ ᎤᏖᎸᎮᏍᎬᎢ?
|
|---|
Hna-quo-no Tsa-ni ni-do-da-yu-nv-si-dv i-u-ne-nv, u-le-nv-he Tsa-ni du-ne-i-s-da-ne-le yv-wi; Ga-do i-tsa-ga-ta-nv-se i-na-ge-i? Wa-so-na-s-go u-no-le u-te-lv-he-s-gv-i?
|
|---|
|
|---|
| But what went ye out for to see? A man clothed in soft raiment? Behold, they which are gorgeously apparelled, and live delicately, are in kings' courts.
|
|---|
| ᎦᏙᎨ ᎢᏣᎦᏔᏅᏎᎢ? ᎠᏍᎦᏯᏍᎪ ᏗᏬᏍᎩᎵ ᏧᏄᏩᎢ? ᎬᏂᏳᏉ ᏧᏬᏚᎯ ᏧᎾᏄᏩᎢ ᎠᎴ ᎣᏍᏛ ᏗᎾᎵᏍᏓᏴᎲᏍᎩ ᎤᏂᎬᏫᏳᎯ ᏓᏂᏁᎸ ᎠᏁᎰᎢ.
|
|---|
Ga-do-ge i-tsa-ga-ta-nv-se-i? A-s-ga-ya-s-go di-wo-s-gi-li tsu-nu-wa-i? Gv-ni-yu-quo tsu-wo-du-hi tsu-na-nu-wa-i a-le o-s-dv di-na-li-s-da-yv-hv-s-gi u-ni-gv-wi-yu-hi da-ni-ne-lv a-ne-ho-i.
|
|---|
|
|---|
| But what went ye out for to see? A prophet? Yea, I say unto you, and much more than a prophet.
|
|---|
| ᎦᏙᎨ ᎢᏣᎦᏔᏅᏎᎢ? ᎠᏙᎴᎰᏍᎩᏍᎪ? ᎥᎥ, ᎢᏨᏲᏎᎭ, ᎠᎴ ᎤᏟ ᎠᏥᎸᏉᏗᏳ ᎡᏍᎦᏉ ᎠᏙᎴᎰᏍᎩ.
|
|---|
Ga-do-ge i-tsa-ga-ta-nv-se-i? A-do-le-ho-s-gi-s-go? V-v, i-tsv-yo-se-ha, a-le u-tli a-tsi-lv-quo-di-yu e-s-ga-quo a-do-le-ho-s-gi.
|
|---|
|
|---|
| This is he, of whom it is written, Behold, I send my messenger before thy face, which shall prepare thy way before thee.
|
|---|
| ᎾᏍᎩᏍᎩᏂ ᎯᎠ ᎠᏥᏃᎮᏍᎬ ᎯᎠ ᏥᏂᎬᏅ ᏥᎪᏪᎳ; ᎬᏂᏳᏉ ᏥᏅᎵ ᏥᏅᏏᏓᏍᏗ ᏣᎧᏛ ᎢᎬᏱᏗᏢ, ᎾᏍᎩ ᏓᏣᏛᏅᎢᏍᏓᏁᎵ ᏣᎶᎯᏍᏗᏱ ᎢᎬᏱᏗᏢ.
|
|---|
Na-s-gi-s-gi-ni hi-a a-tsi-no-he-s-gv hi-a tsi-ni-gv-nv tsi-go-we-la; Gv-ni-yu-quo tsi-nv-li tsi-nv-si-da-s-di tsa-ka-dv i-gv-yi-di-tlv, na-s-gi da-tsa-dv-nv-i-s-da-ne-li tsa-lo-hi-s-di-yi i-gv-yi-di-tlv.
|
|---|
|
|---|
| For I say unto you, Among those that are born of women there is not a greater prophet than John the Baptist: but he that is least in the kingdom of God is greater than he.
|
|---|
| ᎯᎠᏰᏃ ᏂᏨᏪᏎᎭ; ᎠᏂᎨᏴ ᎬᏩᏂᎾᏄᎪᏫᏒᎯ ᏥᎩ ᎥᏝ ᏳᏜᏓᏍᏗ ᎩᎶ ᎠᏙᎴᎰᏍᎩ ᎤᏟ ᎢᏯᏥᎷᏉᏗ ᎡᏍᎦᏉ ᏣᏂ ᏗᏓᏬᏍᎩ; ᎠᏎᏃ ᎤᏍᏗᎧᏂ ᎤᏁᎳᏅᎯ ᎤᏤᎵᎪᎯ ᎨᎳ ᎤᏟ ᎠᏥᎸᏉᏗᏳ ᎡᏍᎦᏉ ᏣᏂ.
|
|---|
Hi-a-ye-no ni-tsv-we-se-ha; A-ni-ge-yv gv-wa-ni-na-nu-go-wi-sv-hi tsi-gi v-tla yu-dla-s-di gi-lo a-do-le-ho-s-gi u-tli i-ya-tsi-lu-quo-di e-s-ga-quo Tsa-ni Di-da-wo-s-gi; a-se-no u-s-di-ka-ni U-ne-la-nv-hi u-tse-li-go-hi ge-la u-tli a-tsi-lv-quo-di-yu e-s-ga-quo Tsa-ni.
|
|---|
|
|---|
| And all the people that heard him, and the publicans, justified God, being baptized with the baptism of John.
|
|---|
| ᏂᎦᏛᏃ ᏴᏫ ᎤᎾᏛᎦᏅᎯ, ᎠᎴ ᎠᏕᎸ ᎠᏂᎩᏏᏙᎯ, ᎤᏂᎸᏉᏔᏁ ᎤᏁᎳᏅᎯ, ᏗᎨᎦᎧᏍᏔᏅᎯᏰᏃ ᎨᏎ ᏣᏂ ᏧᏓᏬᏍᏙᏗ ᎨᏒᎢ.
|
|---|
Ni-ga-dv-no yv-wi u-na-dv-ga-nv-hi, a-le a-de-lv a-ni-gi-si-do-hi, u-ni-lv-quo-ta-ne U-ne-la-nv-hi, di-ge-ga-ka-s-ta-nv-hi-ye-no ge-se Tsa-ni tsu-da-wo-s-do-di ge-sv-i.
|
|---|
|
|---|
| But the Pharisees and lawyers rejected the counsel of God against themselves, being not baptized of him.
|
|---|
| ᎠᏂᏆᎵᏏᏍᎩᏂ ᎠᎴ ᏗᎧᎿᎭᏩᏛᏍᏗ ᏗᏃᏏᏏᏍᎩ ᎤᏁᎳᏅᎯ ᏚᏓᏅᏖᎮᎸᎢ ᎤᏂᏲᎢᏎᎴ ᎤᏅᏒ ᎤᎾᏓᏡᏔᏁᎢ, ᏂᏗᎨᎦᏬᎥᎾ ᎨᏒᎢ.
|
|---|
A-ni-qua-li-si-s-gi-ni a-le di-ka-hna-wa-dv-s-di di-no-si-si-s-gi U-ne-la-nv-hi du-da-nv-te-he-lv-i u-ni-yo-i-se-le u-nv-sv u-na-da-tlu-ta-ne-i, ni-di-ge-ga-wo-v-na ge-sv-i.
|
|---|
|
|---|
| And the Lord said, Whereunto then shall I liken the men of this generation? and to what are they like?
|
|---|
| ᎤᎬᏫᏳᎯᏃ ᎯᎠ ᏄᏪᏎᎢ; ᎦᏙᎨᏙᏓᎦᏥᏯᏟᎶᏍᏔᏂ ᏴᏫ ᎪᎯ ᏣᏁᎭ? ᎠᎴ ᎦᏙ ᏓᎾᏤᎸ?
|
|---|
U-gv-wi-yu-hi-no hi-a nu-we-se-i; Ga-do-ge-do-da-ga-tsi-ya-tli-lo-s-ta-ni yv-wi go-hi tsa-ne-ha? A-le ga-do da-na-tse-lv?
|
|---|
|
|---|
| They are like unto children sitting in the marketplace, and calling one to another, and saying, We have piped unto you, and ye have not danced; we have mourned to you, and ye have not wept.
|
|---|
| ᏗᏂᏲᎵᏉ ᎾᏍᎩᏯ ᎦᏃᏙᏗᏱ ᏣᏂᏃᎢ, ᎠᎴ ᏥᏫᏓᎾᏓᏯᏂᏍᎪᎢ, ᎯᎠ ᏥᏫᎾᏂᏪᏍᎪᎢ; ᎠᏤᎷᎩ ᎣᎬᏔᏅ ᏕᏨᏃᎩᎡᎸ, ᎠᏎᏃ ᎥᏝ ᏱᏣᎵᏍᎩᏎᎢ; ᏙᏥᏴᎬ ᎢᏣᏛᎪᏗ, ᎠᏎᏃ ᎥᏝ ᏱᏗᏣᏠᏱᎴᎢ.
|
|---|
Di-ni-yo-li-quo na-s-gi-ya ga-no-do-di-yi tsa-ni-no-i, a-le tsi-wi-da-na-da-ya-ni-s-go-i, hi-a tsi-wi-na-ni-we-s-go-i; A-tse-lu-gi o-gv-ta-nv de-tsv-no-gi-e-lv, a-se-no v-tla yi-tsa-li-s-gi-se-i; do-tsi-yv-gv i-tsa-dv-go-di, a-se-no v-tla yi-di-tsa-tlo-yi-le-i.
|
|---|
|
|---|
| For John the Baptist came neither eating bread nor drinking wine; and ye say, He hath a devil.
|
|---|
| ᏣᏂᏰᏃ ᏗᏓᏬᏍᎩ ᎤᎷᏨᎩ ᎥᏝ ᎦᏚ ᏯᎩᏍᎨᎢ, ᎥᏝ ᎠᎴ ᎩᎦᎨ-ᎠᏗᏔᏍᏗ ᏯᏗᏔᏍᎨᎢ; ᎯᎠᏃ ᏂᏥᏪᏎ; ᎠᏍᎩᎾ ᎤᏯᎠ.
|
|---|
Tsa-ni-ye-no Di-da-wo-s-gi u-lu-tsv-gi v-tla ga-du ya-gi-s-ge-i, v-tla a-le gi-ga-ge--a-di-ta-s-di ya-di-ta-s-ge-i; hi-a-no ni-tsi-we-se; A-s-gi-na u-ya-a.
|
|---|
|
|---|
| The Son of man is come eating and drinking; and ye say, Behold a gluttonous man, and a winebibber, a friend of publicans and sinners!
|
|---|
| ᏴᏫ ᎤᏪᏥ ᎤᎷᏨ ᎠᎵᏍᏓᏴᎲᏍᎦ ᎠᎴ ᎠᏗᏔᏍᎦ; ᎯᎠᏃ ᏂᏥᏪᎭ; ᎬᏂᏳᏉ ᎠᏍᎦᏯ ᎤᎬᎥᏍᎩ ᎠᎵᏍᏓᏴᏗ ᎠᎴ ᎩᎦᎨ-ᎠᏗᏔᏍᏗ ᎠᏗᏔᏍᎩ, ᎠᏕᎸ ᎠᏂᎩᏏᏙᎯ ᎠᎴ ᎠᏂᏍᎦᎾ ᎤᎾᎵᎢ.
|
|---|
Yv-wi U-we-tsi u-lu-tsv a-li-s-da-yv-hv-s-ga a-le a-di-ta-s-ga; hi-a-no ni-tsi-we-ha; Gv-ni-yu-quo a-s-ga-ya u-gv-v-s-gi a-li-s-da-yv-di a-le gi-ga-ge--a-di-ta-s-di a-di-ta-s-gi, a-de-lv a-ni-gi-si-do-hi a-le a-ni-s-ga-na u-na-li-i.
|
|---|
|
|---|
| But wisdom is justified of all her children.
|
|---|
| ᎠᏎᏃ ᎠᎦᏔᎾᎢ ᏧᏪᏥ ᏂᎦᏛ ᎣᏏᏳ ᎢᎬᏩᏰᎸᎭ
|
|---|
A-se-no a-ga-ta-na-i tsu-we-tsi ni-ga-dv o-si-yu i-gv-wa-ye-lv-ha
|
|---|
|
|---|
| And one of the Pharisees desired him that he would eat with him. And he went into the Pharisee's house, and sat down to meat.
|
|---|
| ᎩᎶᏃ ᎢᏳᏍᏗ ᎠᏆᎵᏏ ᎤᏔᏲᏎᎴ ᎤᎵᏍᏓᏴᎾᏁᏗᏱ ᏭᏴᎴᏃ ᎠᏆᎵᏏ ᎦᏁᎸᎢ, ᎠᎴ ᎤᎵᎩᏳᏍᏓᏅᏁ ᎠᎵᏍᏓᏴᏗᏱ.
|
|---|
Gi-lo-no i-yu-s-di A-qua-li-si u-ta-yo-se-le u-li-s-da-yv-na-ne-di-yi Wu-yv-le-no A-qua-li-si ga-ne-lv-i, a-le u-li-gi-yu-s-da-nv-ne a-li-s-da-yv-di-yi.
|
|---|
|
|---|
| And, behold, a woman in the city, which was a sinner, when she knew that Jesus sat at meat in the Pharisee's house, brought an alabaster box of ointment,
|
|---|
| ᎬᏂᏳᏉᏃ ᎠᎨᏴ ᎾᎿᎭᎦᏚᎲ ᎡᎯ, ᎠᏍᎦᎾᎢ, ᎤᏙᎴᎰᏒ ᏥᏌ ᎠᏆᎵᏏ ᎦᏁᎸ ᎦᏅᎬ ᎠᎵᏍᏓᏴᎲᏍᎬᎢ, ᎤᏲᎴ ᎫᎫ ᏅᏯ ᎤᏁᎬ ᎪᏢᏔᏅᎯ ᎠᏟᏍᏕ ᎠᏠᏁᏗ,
|
|---|
Gv-ni-yu-quo-no a-ge-yv na-hna ga-du-hv e-hi, a-s-ga-na-i, u-do-le-ho-sv Tsi-sa A-qua-li-si ga-ne-lv ga-nv-gv a-li-s-da-yv-hv-s-gv-i, u-yo-le gu-gu nv-ya u-ne-gv go-tlv-ta-nv-hi a-tli-s-de a-tlo-ne-di,
|
|---|
|
|---|
| And stood at his feet behind him weeping, and began to wash his feet with tears, and did wipe them with the hairs of her head, and kissed his feet, and anointed them with the ointment.
|
|---|
| ᎠᎴ ᎤᎴᏁ ᏚᏜᏓᏌᏛ ᎣᏂᏗᏢ ᏓᏠᏱᎮᎢ, ᎠᎴ ᎤᎴᏅᎮ ᏧᎳᏏᏕᏂ ᏚᏬᏑᎴᏔᏁ ᏧᎦᏌᏬᎸᎯ, ᎠᎴ ᏚᎧᏲᏙᏔᏁ ᎤᏍᏗᏰᎬᎢ, ᎠᎴ ᏚᏚᏣᎳᏁ ᏧᎳᏏᏕᏂ, ᎠᎴ ᏚᎶᏁᏔᏁ ᎠᏠᏁᏗ.
|
|---|
A-le u-le-ne du-dla-sa-dv o-ni-di-tlv da-tlo-yi-he-i, a-le u-le-nv-he tsu-la-si-de-ni du-wo-su-le-ta-ne tsu-ga-sa-wo-lv-hi, a-le du-ka-yo-do-ta-ne u-s-di-ye-gv-i, a-le du-du-tsa-la-ne tsu-la-si-de-ni, a-le du-lo-ne-ta-ne a-tlo-ne-di.
|
|---|
|
|---|
| Now when the Pharisee which had bidden him saw it, he spake within himself, saying, This man, if he were a prophet, would have known who and what manner of woman this is that toucheth him: for she is a sinner.
|
|---|
| ᎠᏆᎵᏏᏃ ᎾᏍᎩ ᏭᏯᏅᏛ ᎤᎪᎲ, ᎤᏁᏤ ᏧᏓᏅᏛ ᎯᎠ ᏂᎦᏪᏍᎨᎢ; ᎯᎠ ᎠᏍᎦᏯ ᎢᏳᏃ ᎠᏙᎴᎰᏍᎩ ᏱᎨᏎ ᏳᏙᎴᎰᏎ ᎾᏍᎩ ᎨᏒ ᎠᎴ ᎢᏳᏍᏗᏉ ᎨᏒ ᎯᎠ ᎠᎨᏴ ᏧᏃᏟᏍᏗᎭ, ᎠᏍᎦᎾᏰᏃ.
|
|---|
A-qua-li-si-no na-s-gi wu-ya-nv-dv u-go-hv, u-ne-tse tsu-da-nv-dv hi-a ni-ga-we-s-ge-i; Hi-a a-s-ga-ya i-yu-no a-do-le-ho-s-gi yi-ge-se yu-do-le-ho-se na-s-gi ge-sv a-le i-yu-s-di-quo ge-sv hi-a a-ge-yv tsu-no-tli-s-di-ha, a-s-ga-na-ye-no.
|
|---|
|
|---|
| And Jesus answering said unto him, Simon, I have somewhat to say unto thee. And he saith, Master, say on.
|
|---|
| ᏥᏌᏃ ᎤᏁᏨ ᎯᎠ ᏄᏪᏎᎴᎢ; ᏌᏩᏂ, ᎠᎩᎭ ᎪᎱᏍᏗ ᎬᏲᏎᏗ. ᎯᎠᏃ ᏄᏪᏎᎢ; ᏔᏕᏲᎲᏍᎩ, ᏂᏫᎪᎦ.
|
|---|
Tsi-sa-no u-ne-tsv hi-a nu-we-se-le-i; Sa-wa-ni, a-gi-ha go-hu-s-di gv-yo-se-di. Hi-a-no nu-we-se-i; Ta-de-yo-hv-s-gi, ni-wi-go-ga.
|
|---|
|
|---|
| There was a certain creditor which had two debtors: the one owed five hundred pence, and the other fifty.
|
|---|
| ᎩᎶ ᎢᏳᏍᏗ ᎡᎮ ᏧᏓᏚᎩ, ᎾᏍᎩ ᎠᏂᏔᎵ ᏧᏚᎩ ᎠᏁᎮᎢ; ᏏᏴᏫ ᎯᏍᎩᏧᏈ ᎠᏂᎩᏏ ᏧᎾᎬᏩᎶᏗ ᎠᏥᏚᎨᎢ, ᏐᎢᏃ ᎯᏍᎦᏍᎪᎯ.
|
|---|
Gi-lo i-yu-s-di e-he tsu-da-du-gi, na-s-gi a-ni-ta-li tsu-du-gi a-ne-he-i; si-yv-wi hi-s-gi-tsu-qui a-ni-gi-si tsu-na-gv-wa-lo-di a-tsi-du-ge-i, so-i-no hi-s-ga-s-go-hi.
|
|---|
|
|---|
| And when they had nothing to pay, he frankly forgave them both. Tell me therefore, which of them will love him most?
|
|---|
| ᎪᎱᏍᏗᏃ ᏄᏂᎲᎾ ᎨᏒ ᎤᎾᎫᏴᏙᏗ, ᏚᏲᏎᏉ ᎢᏧᎳ. ᎾᏍᎩᏃ ᏍᎩᏃᎲᏏ, ᎦᎪ ᎾᏍᎩ ᎤᏟ ᏄᏓᎨᏳᏎᏍᏗ?
|
|---|
Go-hu-s-di-no nu-ni-hv-na ge-sv u-na-gu-yv-do-di, du-yo-se-quo i-tsu-la. Na-s-gi-no s-gi-no-hv-si, ga-go na-s-gi u-tli nu-da-ge-yu-se-s-di?
|
|---|
|
|---|
| Simon answered and said, I suppose that he, to whom he forgave most. And he said unto him, Thou hast rightly judged.
|
|---|
| ᏌᏩᏂ ᏧᏁᏨ ᎯᎠ ᏄᏪᏎᎢ; ᎠᏎᎨᎵ ᎾᏍᎩ Ꮎ ᎤᏟ ᎢᎦᎢ ᏗᎬᏩᏲᎯᏎᎸᎯ. ᎯᎠᏃ ᏄᏪᏎᎴᎢ; ᏚᏳᎪᏛ ᏕᎱᎪᏓ.
|
|---|
Sa-wa-ni tsu-ne-tsv hi-a nu-we-se-i; A-se-ge-li na-s-gi na u-tli i-ga-i di-gv-wa-yo-hi-se-lv-hi. Hi-a-no nu-we-se-le-i; Du-yu-go-dv de-hu-go-da.
|
|---|
|
|---|
| And he turned to the woman, and said unto Simon, Seest thou this woman? I entered into thine house, thou gavest me no water for my feet: but she hath washed my feet with tears, and wiped them with the hairs of her head.
|
|---|
| ᎠᎨᏴᏃ ᎦᏙᎬ ᎢᏗᏢ ᏭᎦᏔᎲᏍᏔᏅ ᎯᎠ ᎾᏥᏪᏎᎴ ᏌᏩᏂ; ᎯᎪᏩᏘᏍᎪ ᎯᎠ ᎠᎨᏴ? ᎯᏁᎸ ᎠᎩᏴᎸᎩ, ᎠᎹ ᎥᏝ ᏱᏍᎩᏁᏁᎴ ᏗᏉᏑᎴᏗ ᏗᏆᎳᏏᏕᏂ; ᎾᏍᎩᏍᎩᏂ Ꮎ ᏓᏉᏑᎵᏏ ᏗᏆᎳᏏᏕᏂ ᏧᎦᏌᏬᎸᎯ ᎬᏓ, ᎠᎴ ᏓᎩᎧᏲᏙᏓᏏ ᎤᏍᏘᏰᎬᎢ.
|
|---|
A-ge-yv-no ga-do-gv i-di-tlv wu-ga-ta-hv-s-ta-nv hi-a na-tsi-we-se-le Sa-wa-ni; Hi-go-wa-ti-s-go hi-a a-ge-yv? Hi-ne-lv a-gi-yv-lv-gi, a-ma v-tla yi-s-gi-ne-ne-le di-quo-su-le-di di-qua-la-si-de-ni; na-s-gi-s-gi-ni na da-quo-su-li-si di-qua-la-si-de-ni tsu-ga-sa-wo-lv-hi gv-da, a-le da-gi-ka-yo-do-da-si u-s-ti-ye-gv-i.
|
|---|
|
|---|
| Thou gavest me no kiss: but this woman since the time I came in hath not ceased to kiss my feet.
|
|---|
| ᎥᏝ ᏱᏍᏆᏔᏪᏙᏁᎢ; ᎯᎠᏍᎩᏂ ᎠᎨᏴ, ᎠᎩᏴᎵᎸ ᏅᏓᎬᏩᏓᎴᏅᏛ, ᎥᏝ ᏳᏑᎵᎪᏨ ᏓᏆᏚᏣᎳᏁᎲ ᏗᏆᎳᏏᏕᏂ.
|
|---|
V-tla yi-s-qua-ta-we-do-ne-i; hi-a-s-gi-ni a-ge-yv, a-gi-yv-li-lv nv-da-gv-wa-da-le-nv-dv, v-tla yu-su-li-go-tsv da-qua-du-tsa-la-ne-hv di-qua-la-si-de-ni.
|
|---|
|
|---|
| My head with oil thou didst not anoint: but this woman hath anointed my feet with ointment.
|
|---|
| ᏥᏍᎪᎵ ᎥᏝ ᏱᏍᎩᎶᏁᏔᏁ ᎪᎢ; ᎯᎠᏍᎩᏂ ᎠᎨᏴ ᎠᏠᏁᏗ ᏚᎶᏁᏔᏅ ᏗᏆᎳᏏᏕᏂ.
|
|---|
Tsi-s-go-li v-tla yi-s-gi-lo-ne-ta-ne go-i; hi-a-s-gi-ni a-ge-yv a-tlo-ne-di du-lo-ne-ta-nv di-qua-la-si-de-ni.
|
|---|
|
|---|
| Wherefore I say unto thee, Her sins, which are many, are forgiven; for she loved much: but to whom little is forgiven, the same loveth little.
|
|---|
| ᎾᏍᎩ ᎢᏳᏍᏗ ᎯᎠ ᏂᎬᏪᏎᎭ; ᎤᏍᎦᏅᏨ, ᎾᏍᎩ ᏧᏈᏯ ᏥᎩ, ᎠᏥᏙᎵᎩ, ᎤᏣᏘᏰᏃ ᎤᏓᎨᏳᏎᎢ; ᎩᎶᏍᎩᏂ ᎤᏍᏗ ᎠᏥᏙᎵᏨᎯ, ᎾᏍᎩ ᎤᏍᏗ ᎤᏓᎨᏳᏐᎢ.
|
|---|
Na-s-gi i-yu-s-di hi-a ni-gv-we-se-ha; U-s-ga-nv-tsv, na-s-gi tsu-qui-ya tsi-gi, a-tsi-do-li-gi, u-tsa-ti-ye-no u-da-ge-yu-se-i; gi-lo-s-gi-ni u-s-di a-tsi-do-li-tsv-hi, na-s-gi u-s-di u-da-ge-yu-so-i.
|
|---|
|
|---|
| And he said unto her, Thy sins are forgiven.
|
|---|
| ᎯᎠᏃ ᏄᏪᏎᎴ ᎠᎨᏴ; ᏣᏍᎦᏅᏨ ᎡᏣᏙᎵᎩ.
|
|---|
Hi-a-no nu-we-se-le a-ge-yv; Tsa-s-ga-nv-tsv e-tsa-do-li-gi.
|
|---|
|
|---|
| And they that sat at meat with him began to say within themselves, Who is this that forgiveth sins also?
|
|---|
| ᎾᏍᎩᏃ Ꮎ ᎢᏧᎳᎭ ᎠᏂᏂᏜᏓᎢ ᎠᎾᎵᏍᏓᏴᎲᏍᎬ ᎤᎾᎴᏅᎮ ᏙᏧᎾᏓᏅᏛ ᎯᎠ ᏄᏂᏪᏎᎢ; ᎦᎪ ᎾᏍᎩ ᎯᎠ, ᎠᏍᎦᏅᏨ ᎾᏍᏉ ᏥᏕᎦᏙᎵᎦ?
|
|---|
Na-s-gi-no na i-tsu-la-ha a-ni-ni-dla-i a-na-li-s-da-yv-hv-s-gv u-na-le-nv-he do-tsu-na-da-nv-dv hi-a nu-ni-we-se-i; Ga-go na-s-gi hi-a, a-s-ga-nv-tsv na-s-quo tsi-de-ga-do-li-ga?
|
|---|
|
|---|
| And he said to the woman, Thy faith hath saved thee; go in peace.
|
|---|
| ᎯᎠᏃ ᏄᏪᏎᎴ ᎠᎨᏴ, ᏦᎯᏳᏒ ᏣᏍᏕᎸ; ᏅᏩᏙᎯᏯᏛ ᏥᎮᎾ.
|
|---|
Hi-a-no nu-we-se-le a-ge-yv, Tso-hi-yu-sv tsa-s-de-lv; nv-wa-do-hi-ya-dv tsi-he-na.
|
|---|


Hello World from Microsoft Azure...
This web site is uploaded by
Almir Vuk
via
Visual Studio Code
and
GitHub
♥


Gorgeous BMW M8 Gran Coupe Enters Production
The new BMW 8 Series family is now complete.
by Martin BiggThe new BMW 8 Series Gran Coupe is one of the Bavarian automaker's best-looking models yet. But it didn't take long to get even better. Back in October, BMW introduced the more powerful M8 version of the elegant four-door coupe, and we've been swooning over it ever since.
Now, the first-ever BMW M8 Gran Coupe has entered production at the automaker's plant in Dingolfing, Germany, completing the new 8 Series family. BMW's Dingolfing plant produces up to 60 units of the BMW M8 model family per day, but the Gran Coupe is already proving popular as it accounts for over 40 percent of the M8's production volume.
"With the new BMW M8 Gran Coupe, the location once again proved what it is made of. After five successful attempts in 2019, we once again topped the top of our model portfolio and strengthened our position as the leader of the luxury segment. All employees can be proud of that," said Christoph Schroder, Head of BMW Group's Dingolfing plant.
Like all other M8 models, the gorgeous Gran Coupe is powered by a 4.4-liter twin-turbo V8 that sends 600 horsepower and 553 lb-ft of torque to all four wheels through an eight-speed automatic transmission. The Competition variant increases the output to 617 hp. 0-62 mph in the regular M8 Gran Coupe takes just 3.1 seconds, while the Competition model can do the same sprint a tenth of a second quicker. Both cars max out at an electronically limited 155 mph, but this can be increased to 190 mph with the optional M Driver's Package.
You Might Also Like
The new BMW M8 Gran Coupe will make its world premiere this week at the 2019 Los Angeles Auto Show. After this, both the BMW M8 Gran Coupe and the BMW M8 Competition Gran Coupe will arrive in dealers in January 2020.
From April, a limited edition BMW M8 Gran Coupe First Edition will also be available. Limited to 400 units, the special First Edition will feature a BMW Individual Aurora Diamant Green metallic special paint finish and the BMW Iconic Laser light in vibrant yellow.


--- layout: page title: About header-img: "img/about-bg.png" ---
I am a soft science native in the psychological field trying to learn about the analytical component of my brains


| Opcode | Instruction | 64-Bit Mode | Compat/Leg Mode | Description |
|---|---|---|---|---|
| D9 F9 | FYL2XP1 | Valid | Valid | Replace ST(1) with ST(1) ∗ log2(ST(0) + 1.0) and pop the register stack. |
Computes (ST(1) ∗ log2(ST(0) + 1.0)), stores the result in register ST(1), and pops the FPU register stack. The source operand in ST(0) must be in the range:
The source operand in ST(1) can range from −∞ to +∞. If the ST(0) operand is outside of its acceptable range, the result is undefined and software should not rely on an exception being generated. Under some circumstances exceptions may be generated when ST(0) is out of range, but this behavior is implementation specific and not guaranteed.
The following table shows the results obtained when taking the log epsilon of various classes of numbers, assuming that underflow does not occur.
F Meansfinitefloating-pointvalue.
* Indicatesfloating-pointinvalid-operation(#IA)exception.
This instruction provides optimal accuracy for values of epsilon [the value in register ST(0)] that are close to 0. For small epsilon (ε) values, more significant digits can be retained by using the FYL2XP1 instruction than by using (ε+1) as an argument to the FYL2X instruction. The (ε+1) expression is commonly found in compound interest and annuity calculations. The result can be simply converted into a value in another logarithm base by including a scale factor in the ST(1) source operand. The following equation is used to calculate the scale factor for a particular logarithm base, where n is the logarithm base desired for the result of the FYL2XP1 instruction:
scale factor ← logn 2
This instruction’s operation is the same in non-64-bit modes and 64-bit mode.
ST(1) ← ST(1) ∗ log2(ST(0) + 1.0); PopRegisterStack;
| C1 | Set to 0 if stack underflow occurred. |
| Set if result was rounded up; cleared otherwise. | |
| C0, C2, C3 | Undefined. |
| #IS | Stack underflow occurred. |
| #IA | Either operand is an SNaN value or unsupported format. |
| #D | Source operand is a denormal value. |
| #U | Result is too small for destination format. |
| #O | Result is too large for destination format. |
| #P | Value cannot be represented exactly in destination format. |
| #NM | CR0.EM[bit 2] or CR0.TS[bit 3] = 1. |
| #MF | If there is a pending x87 FPU exception. |
| #UD | If the LOCK prefix is used. |
Same exceptions as in protected mode.
Same exceptions as in protected mode.
Same exceptions as in protected mode.
Same exceptions as in protected mode.


Integration Time Calculator Test Page
This page provides a simple way to test the ITC servlets by using the ITC forms for Gemini North and South instruments.
Note that these forms are not the same ones as in the production server.
Gemini North
Gemini South
Instrument
Test Page
Acquisition Camera
ITCacqCam.html
GMOS North
ITCgmos.html
GNIRS
ITCgnirs.html
IGRINS-2
ITCigrins2.html
Michelle
ITCmichelle.html
NIFS
ITCnifs.html
NIRI
ITCniri.html
Instrument
Test Page
Flamingos 2
ITCflamingos2.html
GHOST
ITCghost.html
GMOS South
ITCgmosSouth.html
GSAOI
ITCgsaoi.html
TRECS
ITCtrecs.html
Source code documentation:
../itcdocs/html/
Plots of data files:
../itcdocs/plots/


Class: 'Bruker AutoClean'
http://nmrML.org/nmrCV#NMR:1400205
Annotations (2)
-
comment "def: In today's fast-paced research environment, NMR tubes are often used once and discarded, creating needless waste. With the Bruker BioSpin Autoclean™ system you can now recycle 5mm, 3mm, or 5mm/3mm step-down (Wilmad 520-1B) NMR tubes. AutoClean NMR Tube Washing System is a simple way to recoup the substantial investment your organization makes in quality NMR tubes, and cut back on needless waste material.
defprov: Bruker website" (string)
-
label "Bruker AutoClean" (string)
Superclasses (1)
Usage (1)
-
Class: 'Bruker AutoClean'


2710 Benevento Way, Cedar Park 2710 Benevento Way, Cedar Park
$780,860
2710 Benevento Way, Ced...
McKinley Heights
MG
Mary Goverl
01/21/2019
Are there things that I’m not aware of about the house?
+1(512)-564-2322
marygoverl@gmail.com


the go-to website for algebra and geometry
With our ever-expanding collection of fully functional and advanced calculators, we got you covered for any problem you may encounter.
MathFlare's goal is to help students of all grades to achieve academic success by offering numerous useful tools and documentation for free.
Our website's comprehensive layout and design allows for a pleasing user experience while allowing the visually impaired to use our calculators like normal.
We really appreciate feedback and suggestions as it is the only way for us to know if we have done any mistake or could have done something better. Feel free to email us or use our contact form to report any mistakes or suggest an addition to our site.
As an open source project with no advertisements or shady data collection, MathFlare's only source of income are donations from our supporters. If you would like to help us continue developing MathFlare, please consider financially supporting us through buymeacoffee, Ko-fi, Patreon or PayPal


{% extends 'homevisit/base.html' %} {% block title %}Contact Us: Successful!{% endblock %} {% block content %} Thank you for your feedback. We will be in touch soon. {% endblock %}


They are
very literal and when writing code one must be
careful and accurate.
Inline vs Block Elements
- blocks elements form a box around the content


You can invite up to 2 additional users on the Free plan. There is no limit on team members for the Premium plan.
No more than 2GB. All files in your account must fit your allotted storage space.
Click “Forgot password” from the login page or “Change password” from your profile page. A reset link will be emailed to you.
Yes! Send us a message and we’ll process your request no questions asked.
Chat and email support is available 24/7. Phone lines are open during normal business hours.


The following is a transcript of an example session which tunnels the local
ports 9090 and 9091 via the pipe2me server at http://test.pipe2.me.
TEMP_DIR=$(mktemp -d)
cd "$TEMP_DIR"
pipe2me setup --protocols http,https \
--server http://test.pipe2.me \
--token review@pipe2me --ports 9090,9091
[POST] http://test.pipe2.me/tunnels/review@pipe2me: 422 msecs.
Generating public/private rsa key pair.
Your identification has been saved in pipe2me.id_rsa.
Your public key has been saved in pipe2me.id_rsa.pub.
The key fingerprint is:
8a:69:40:72:1c:fa:c9:64:0a:ca:ba:b4:a2:4f:50:9f clever-violet-hippo.test.pipe2.me
The key's randomart image is:
+--[ RSA 2048]----+
| . |
| o . |
|+ B |
|+@ o . |
|+.= E S |
|.. . o . |
|... + . |
|oo.. |
|=o. |
+-----------------+
[POST] http://test.pipe2.me/tunnels/3924856980713465935/id_rsa.pub: 382 msecs.
Generating a 1024 bit RSA private key
.............++++++
...............................++++++
writing new private key to 'pipe2me.openssl.priv'
-----
[POST] http://test.pipe2.me/tunnels/3924856980713465935/cert.pem: 130 msecs.
clever-violet-hippo.test.pipe2.me
cat pipe2me.info.inc
PIPE2ME_ID=3924856980713465935
PIPE2ME_FQDN=clever-violet-hippo.test.pipe2.me
PIPE2ME_URLS_0=http://clever-violet-hippo.test.pipe2.me:10008
PIPE2ME_URLS_1=https://clever-violet-hippo.test.pipe2.me:10009
PIPE2ME_TUNNEL=ssh://pipe2me@test.pipe2.me:8444
source pipe2me.info.inc
pipe2me start --echo &
[1] 20495
sleep 5s # wait until startup has completed
Starting http echo server on port 9090
Starting https echo server on port 9091
Tunneling http://localhost:9090 <=> http://clever-violet-hippo.test.pipe2.me:10008
Tunneling https://localhost:9091 <=> https://clever-violet-hippo.test.pipe2.me:10009
16:02:18 http_10008.1 | started with pid 20501
16:02:18 https_10009.1 | started with pid 20502
16:02:18 echo_9090.1 | started with pid 20503
16:02:18 echo_9091.1 | started with pid 20504
16:02:18 https_10009.1 | Warning: Permanently added '[test.pipe2.me]:8444,[<IP_ADDRESS>]:8444' (RSA) to the list of known hosts.
# now connect to the externally accessible URLs
curl "$PIPE2ME_URLS_0/hello"
16:02:23 echo_9090.1 | localhost.localdomain - - [30/Jan/2014:16:02:23 CET] "GET /hello HTTP/1.1" 200 11
16:02:23 echo_9090.1 | - -> /hello
GET /hello
curl -k "$PIPE2ME_URLS_1/hello"
16:02:23 echo_9091.1 | localhost.localdomain - - [30/Jan/2014:16:02:23 CET] "GET /hello HTTP/1.1" 200 11
16:02:23 echo_9091.1 | - -> /hello
GET /hello


Turmoil in Dominica as protesters and police clash (see video)
by SNO StaffROSEAU, Dominica — There was turmoil in Roseau, Dominica on Monday night as police clash with protesters who have been calling for electoral reform on the island. (SEE VIDEO BELOW STORY)
The protesters have been gathering peacefully for days now near the official residence of President Charles Savarin, saying they want a meeting with him on the matter. Some even slept in the area but were kept at bay by police barricades.
It is unknown what was the tipping point which led to the unrest, however videos began circulating on social media of groups of people in Roseau burning debris, uprooting plants, breaking bottles and spreading garbage on the streets. Explosions were heard, which people said was the result of gunfire.
Near the presidential house itself, the barricade was taken down by protesters as they clashed with the police.
The police responded with a volley of tear gas.
The protesters dispersed but the country remains on edge. Many Dominicans have taken to social media, wondering what is going to happen next.
Prime Minister of Dominica, Roosevelt Skerrit, is expected to address the nation at 8 a.m. on Tuesday.
Electoral reform
Recently Skerrit announced that general election will be held in Dominica on December 6, 2019.
However, the opposition United Workers Party (UWP) and several groups on the island believe the polls will not be fair without electoral reform.
They have been calling on the Skerrit-led Dominica Labour Party (DLP) administration to clean up the voters’ list, issue voter identification cards, regulate campaign finance and grant equal access to state media resources to all political parties.
To compound the situation, a Commonwealth Observer Mission to Dominica for the 2014 general election stated, “the election was not necessarily fair, due to: the lack of balance, and in some cases lack of professionalism of the media; the absence of campaign finance regulations and the resultant lack of transparency on financing, coupled with the exponentially increased expense associated with campaigning”.
The Observer Mission proposed a laundry list of recommendations, among them a house to house re-verification exercise of voters.
However, the government said it was unable to accept such a recommendation saying it is “unworkable and if implemented will cause confusion and disruption contrary to best practice and importantly will not result in the required updating of the list”.
“It will not result in the mandatory use of the photo ID and will not be properly updated and cleansed. The recommendation of the house to house is not supported by Dominica’s laws and even if it was, it could not properly update or cleanse the voters’ list as proposed,” Attorney General Levi Peter said.
Headline News
-
Saint Lucian in Taiwan’s top TV singing contest November 19, 2019 8:06 AM
-
Mayor Francis unhappy over disarmament of cop by bandits November 19, 2019 7:34 AM
-
CSA happy over collective agreement with LUCELEC but … November 19, 2019 7:19 AM
-
Saint Lucia Forensic Lab working to build public confidence, says director November 19, 2019 4:31 AM
-
PM Chastanet promises super-rich Saint Lucia citizenship in three months November 18, 2019 11:55 AM
-
Guy Joseph shoots down reports of complete St. Jude Hospital demolition November 18, 2019 10:26 AM
-
Central Statistical Office launches Census 2020 recruitment drive November 18, 2019 12:16 AM
-
Saint Lucia gov’t launches programme to boost local production of 7 key fruits, vegetables November 17, 2019 9:50 PM
-
Fuel prices change November 17, 2019 7:00 PM


onTrack Prototype Group 3
ADD
< Back
Name:
Monday
Tuesday
Wednesday
Thursday
Friday
Saturday
Sunday
Task List:


I'm an aspiring self-taught web developer seeking professional experience in building web applications. Using newly learned tools to solve real world challenges are my greatest passions.


Prev
Next
Index->
contents
reference
index
search
external
Up->
mat2cpp
_index
mat2cpp->
License
getstarted
operation
mat2cpp.hpp
mat2cpp_ok.m
mat2cpp_ok.cpp
News
library
mztuni
_index
Headings->
A
C
D
E
G
I
L
M
N
O
P
R
S
T
U
Z
Keyword Index
A
add
element
Elementwise Addition
C
C
++
uniform
random
number
generator
C++ Marsaglia Zaman Tsang Uniform Random Number Generator
cholesky
Cholesky Factor a Matrix Division
matrix
Cholesky Factor a Matrix Division
D
diag
_
prod
Diagonal Matrix Product with General Matrix
diagonal
product
Diagonal Matrix Product with General Matrix
division
element
Elementwise Division
matrix
Matrix Division
scalar
Scalar Division
E
element
add
Elementwise Addition
division
Elementwise Division
product
Elementwise Product
subtract
Elementwise Subtraction
element
_
div
Elementwise Division
element
_
prod
Elementwise Product
elementwise
unary
Matlab or Octave Elementwise Unary Functions
extend
Extending a Vector
G
Gaussian
simulate
Normal Random Matrix
generator
C
++
uniform
random
C++ Marsaglia Zaman Tsang Uniform Random Number Generator
I
include
mat2cpp
.
hpp
The Matlab or Octave to C++ Using Ublas Include File
L
library
mat2cpp
Example Conversion of Matlab or Octave to C++ using Ublas: mat2cpp.hpp
link
mat2cpp
Example Conversion of Matlab or Octave to C++ using Ublas: mat2cpp.hpp
M
Marsaglia
C++ Marsaglia Zaman Tsang Uniform Random Number Generator: Reference
math
function
Matlab or Octave Elementwise Unary Functions
matrix
cholesky
Cholesky Factor a Matrix Division
division
Matrix Division
multiply
Matrix Product
output
Getting Started: Conversion to C++ using C++.Output
product
Matrix Product
rand
Uniform Random Matrix
randn
Normal Random Matrix
times
Matrix Product
matrix
_
div
Matrix Division
max
Maximum Element of a Matrix
min
Minimum Element of a Matrix
multiply
matrix
Matrix Product
N
normal
simulate
Normal Random Matrix
O
ones
Matrix of Ones
output
matrix
Getting Started: Conversion to C++ using C++.Output
P
product
diagonal
Diagonal Matrix Product with General Matrix
element
Elementwise Product
matrix
Matrix Product
scalar
Scalar Product
R
rand
matrix
Uniform Random Matrix
randn
matrix
Normal Random Matrix
random
C
++
uniform
generator
C++ Marsaglia Zaman Tsang Uniform Random Number Generator
S
scalar
Convert Matrix to Scalar
division
Scalar Division
product
Scalar Product
scalar
_
div
Scalar Division
scalar
_
prod
Scalar Product
simulate
normal
Normal Random Matrix
size
Matrix Size
slice
Matrix Slices
sub
-
matrix
Matrix Slices
subtract
element
Elementwise Subtraction
sum
Sum The Elements of a Matlab
T
Tsang
C++ Marsaglia Zaman Tsang Uniform Random Number Generator: Reference
times
matrix
Matrix Product
transpose
Matrix Transpose
typo
C++ Marsaglia Zaman Tsang Uniform Random Number Generator: Reference.Typo
U
unary
elementwise
Matlab or Octave Elementwise Unary Functions
uniform
C
++
random
generator
C++ Marsaglia Zaman Tsang Uniform Random Number Generator
Z
Zaman
C++ Marsaglia Zaman Tsang Uniform Random Number Generator: Reference
zeros
Matrix of Zeros


Triples of the Data Model
| Subject |
Predicate |
Object |
| https://www.w3schools.com |
https://www.w3schools.com/rdf/title |
"W3Schools.com" |
| https://www.w3schools.com |
https://www.w3schools.com/rdf/author |
"Jan Egil Refsnes" |
The original RDF/XML document
1: <?xml version="1.0"?>
2: <rdf:RDF
3: xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
4: xmlns:si="https://www.w3schools.com/rdf/">
5: <rdf:Description rdf:about="https://www.w3schools.com">
6: <si:title>W3Schools.com</si:title>
7: <si:author>Jan Egil Refsnes</si:author>
8: </rdf:Description>
9: </rdf:RDF>
Graph of the data model


Home
Update Profile
Profile
View Candidates
Log Out
Update Profile
First Name
Last name
Other name
Email
Phone Number
Password
Profile Image
Update Profile


Data anchors applications. Using the laws of physics as an analogy, data has a lot of “mass”,
which means it takes a lot of effort to move around. Furthermore, “data entropy” results in it spreading across
silos, which also makes it more difficult to store and protect. And data has a high coefficient of friction; it’s
often the most restrictive force in application projects. It’s a huge issue and it’s been this way for a very long
time.
Data Friction manifests itself in a variety of ways
Data Friction, the sum total of complexity and delays in delivering data to data consumers in
the enterprise, is a growing concern. DataOps aims to minimize data friction so that enterprises can leverage data
quickly, easily and when needed in order to maximize their business performance.
Data Friction can result from the activities:
- Governance: Enterprise data governance activities ensure that the right people can access the right data, that the
data is not tampered with, and that unauthorized access or data changes can be tracked. Governance becomes even
more important in heavily regulated industries with sensitive data, such as healthcare, finance, or retail. Manual
or immature approaches to handling these concerns slows down data delivery and increases the risk profile for the
business. Additionally, many scenarios encountered by data consumers require repeated use of known data states,
reuse of those states with minor modifications, or referencing distinct data sets for collaborative purposes.
Bringing data, and its associated objects and changes, under version control helps drive higher quality, efficiency
and predictability in activities of data consumers.
- Operations: Without operational excellence, availability of data platforms and systems cannot be guaranteed.
Disrupted availability can result in downtime that impacts revenue, reputation and trust. Most enterprises invest heavily
in monitoring, downtime prevention, backup, recovery, scalability and redundancy of data systems. With increasingly
heterogeneous data environments, this task becomes even more complex. Without a comprehensive strategy, culture, and accompanying
tooling, a streamlined and reliable approach to operational excellence becomes difficult to achieve.
- Delivery: Most large organizations hundreds if not thousands of apps and data stores, sprawling across organizational and
geographic boundaries. It can be difficult for data consumers to access the data they need if it is splintered across multiple
systems, or otherwise inaccessible due to security controls, permissions restrictions, or performance impact on production systems.
In these scenarios, manual effort and coordination across teams is often required to provision the right data, making efficient
delivery at scale untenable.
- Definition: Long standing companies often have legacy data sources that have been present longer than most employees;
which can result in losing the original intent of why some data was captured or how it was used. Additionally, with the explosion
of the volume of data and the proliferation of new data sources, the data landscape has become a complicated web, filled with
fragile interconnected dependencies, that is entangling and complicating our businesses. The lack of a defined and documented data
landscape makes it impossible to have a clear view of the complete data needs and requirements of the business.
- Transformation: Data consumers are increasingly combining data in innovative ways to derive a deeper understanding of their
businesses. To leverage data from existing repositories within new contexts, it often must be transformed in terms of
structure/schema, or to meet business concerns such as privacy. Techniques such as masking, de-identification, and schema
conversion transform data into a form that is usable. However, these solutions can be time-consuming and error-prone without the
appropriate tooling and automation. While new “flow”-oriented constructs such as data pipelines are helping organizations
transform and use data on-demand or in real-time, traditional “batch”-oriented means of transformation such as ETL are still
common sources of friction.
In practice, multiple sources of Data Friction manifest together in various scenarios. For example, an enterprise seeking to
understand customer purchase behavior might require a copy of production data (Delivery) with personally-identifiable information that has been
obfuscated or masked (Transformation).
Without a concerted and intentional effort to address it through DataOps, Data Friction becomes the rate-limiting
factor affecting many enterprises’ ability to capitalize on innovation.


- This application was made for those who are already
familiar with JavaScript Regular Expressions and wish to test
theirs.
Format RegExps like: /[a-z]/g
- Anchors
- ^Start of string, or start of line in multi-line pattern
- $End of string, or end of line in multi-line pattern
- \bWord boundary
- \BNot word boundary
- Character Classes
- \cControl character
- \sWhite space
- \SNot white space
- \dDigit
- \DNot digit
- \wWord character
- \WNot word character
- Assertions
- ?=Lookahead assertion
- ?!Negative lookahead
- Quantifiers
- *0 or more
- +1 or more
- ?0 or 1
- {3}Exactly 3
- {3,}3 or more
- {3,5}3, 4, or 5
- Add a ? to a quantifier to make it ungreedy.
- Common Metacharacters
- ^ [ ] . $ { } * ( ) \ + | ? < >
- The escape character is usually the backslash \
- Special Characters
- \nNew line
- \rCarriage return
- \tTab
- \vVertical tab
- \fForm feed
- \xxxOctal character xxx
- \xhhHex character hh
- \uhhhhUnicode character with hex code hhhh
- Groups and Ranges
- .Any character except new line (\n)
- (a|b)a or b
- (...)Group
- (?:...)Passive (non-capturing) group
- [abc]Range (a or b or c)
- [^abc]Not a or b or c
- [a-q]Letter from a to q
- [A-Q]Upper case letter from A to Q
- [0-7]Digit from 0 to 7
- \xxth group/subpattern
- Ranges are inclusive.
- Pattern Modifiers
- gGlobal match
- iCase-insensitive
- mMultiple lines
- Special thanks to Dave Child for his
Regular Expressions Cheat Sheet
*His Cheat Sheet isn't JavaScript specific.


Paper Moon (1973)
Grade: 93
"Paper Moon" is an outstanding comedy and drama. Set in the midwest during the Great Depression, the era comes to life with black and white cinematography, automobiles, radio shows and popular music.
 Small-time con artist and probable father Moses Pray (Ryan O'Neal, Tatum's real-life father) agrees to take Addie to her only known relatives in another state. Addie turns out to be an even better con artist than Moses, and the two become partners. Later, Moses falls for 'dancer' Trixie Delight (Madeline Kahn), and gets into trouble with corrupt sheriff John Hillerman.
The acting of Ryan O'Neal has been criticized throughout his career, but he is perfect in "Paper Moon". When Addie makes him angry, he fumes silently, just what you would expect from an exasperated father. His understated happiness and despair during good and bad times is also appropriate to his character.
"Paper Moon" continued the success of director Peter Bogdanovich, whose recent films were "What's Up Doc" and "The Last Picture Show". His career would then take a nosedive, and he would not have another hit until "Mask" in 1985.
Tatum O'Neal gives an excellent performance. Unlike other child actors, she is never precocious, except when it is appropriate, such as when perpetrating a con. Her character is sharp well beyond her age, and if it was not cast correctly, it would not be credible. O'Neal makes the role believable.
Madeline Kahn and Tatum O'Neal were both nominated for Best Supporting Actress. O'Neal won, becoming the youngest person to win a major Academy Award. Kahn was on a roll in the early-mid 1970s, with successful roles in the films "What's Up Doc", "Paper Moon", "Blazing Saddles" and "Young Frankenstein", all of which were nominated for Academy or Golden Globe Best Supporting Actress awards.
<EMAIL_ADDRESS>http://members.tripod.com/~Brian_Koller/movies.html
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Please fill out the form for enrolling youself into the system. The system admin will check your details and if you
are authentic user you will have your account activated within in the period of 24 hours of user request. If you do
not get any feedback from the system admin in given time please wait for the reply it may sometime get delay due to
high number of request.
Or you may want to contact system admin right away at info@anilpoudyal.com.np


Rabbit vs Slug
Can they share their greens?


This is used by container to register with GoCD server. Server hostname must resolve in your container.
Don't use localhost
or <IP_ADDRESS>
.
If an elastic agent created by the plugin does not register with the server within the specified timeout period, the plugin will assume that the elastic agent failed to start and will be terminated.
These variables will be passed to the container as environment variables. Read more about
ENV.
10G
.
AWS credentials provider chain that looks for credentials in this order:
AWS_ACCESS_KEY_ID
and AWS_SECRET_ACCESS_KEY
(RECOMMENDED since they are
recognized
by all the AWS SDKs and CLI except for .NET), or AWS_ACCESS_KEY
and
AWS_SECRET_KEY
(only recognized by Java SDK)
However, the auto-detection of credentials can be disabled by providing the AccessKey
and
SecretAccessKey
of AWS user in above fields. Read more about
AWS credentials
Required permissions: Credentials must have permissions to make following api calls.
ec2:runInstances ec2:startInstances ec2:stopInstances ec2:createTags ec2:deleteTags ec2:terminateInstances ec2:describeInstances ec2:describeSubnets ec2:createVolume ec2:attachVolume iam:PassRole ecs:deregisterContainerInstance ecs:describeContainerInstances ecs:listContainerInstances ecs:registerTaskDefinition ecs:deregisterTaskDefinition ecs:startTask ecs:stopTask ecs:listTasks ecs:describeTasks ecs:describeTaskDefinition
These settings are common to both windows and linux instances.
The name of the keypair that you may use to SSH or RDP into the EC2 instance. Read more about Key Pairs
If multiple subnet ids are specified, the subnet having the least number of EC2 instances will be used to spin up a new EC2 instance. If left unspecified or the specified subnet(s) are not available at the time of launching the EC2 instance, AWS will choose a default subnet from your default VPC for you. User can override this from elastic profile. Read more about VPCs & Subnets
EC2 instances will be assigned the security groups(s) specified here. User can override this from elastic profile. Read more about SecurityGroup
The name of the IAM Instance Profile that will allow the ECS agent to make calls to AWS on your behalf. User can override this from elastic profile. At the bare minimum your profile must permit the following API calls:
ecs:discoverPollEndpoint ecs:registerContainerInstance ecs:deregisterContainerInstance ecs:poll ecs:startTelemetrySession ecs:submitContainerStateChange ecs:submitTaskStateChange
Read more about Amazon ECS IAM Policies, Roles and Permissions and ECS Container Instance IAM Role.
This is to configure platform specific defaults for the instance. It will be used to launch new {{SelectedTab | uppercase}} instance. However, user can override these defaults from elastic profile.
The AMI ID
will be used to launch a new instance. User can override this from elastic
profile. We recommend using an
Amazon ECS-Optimized AMI.
The specified InstanceType
will be used to spin up new instances. User can override this
from elastic profile.Read more about
Instance
Type
Allows to override default operating system volume. This is used to store operating system and
docker container persistent data volumes. It will get deleted only on instance termination. Defaults to
8G
.
See docker
volumes
for more information.
Allows to override default storage with specified type and size. This is used to store docker images and
metadata. It will get deleted only on instance termination. Defaults to 22G
.
See docker
storage for more information.
If an EC2 instance created by this plugin does not register with the container service within this timeout
period, the plugin will assume that the instance has failed to start and will be terminated.
Defaults to 5 minutes
.
Minimum linux instances you'd like to have running at any point of time. Defaults to 0
.
Restricts maximum number of linux instances in the cluster. Plugin will not launch new linux instance
if the cluster is already running specified number of instances. Defaults to 5
.
Plugin will stop instances in the ECS cluster based stop policy.
5
minutes
.
InstanceType
or AMI
etc., so you can
gradually replace instances of the old type with instances of the new type.
The plugin terminates the instance which is stopped for more than specified period. Defaults to
5 minutes
.
This allows user to execute command(s) on startup of ec2 instance. Read more about userdata script.
The AMI ID
will be used to launch a new instance. User can override this from elastic profile.
We recommend using an
Amazon ECS-Optimized AMI.
The specified InstanceType
will be used to spin up new instances. User can override this
from elastic profile. Read more about
Instance Type
Allows to override default storage with specified type and size. It will get deleted only on instance
termination. Defaults to 50G
.
If an EC2 instance created by this plugin does not register with the container service within specified
timeout period, the plugin will assume that the instance has failed to start and will be terminated.
Defaults to 15 minutes
.
Minimum windows instances you'd like to have running at any point of time. Defaults to 0
.
Restricts maximum number of windows instances in the cluster. Plugin will not launch new windows
instance if the cluster is already running specified number of instances. Defaults to 5
.
Plugin will stop instances in the ECS cluster based stop policy.
5 minutes
.
5
minutes
.
InstanceType
or AMI
etc., so you can
gradually replace instances of the old type with instances of the new type.
The plugin terminates the instance which is stopped for more than specified period. Defaults to
5 minutes
.
This allows user to execute powershell
commands on startup of instance. Do not use
<powershell>
or <script> tags in script. Read more about
userdata script.
Name of the ECS cluster that will be managed by the plugin. This cluster must already exist.
If you don't specify an Availability Zone, AWS will choose one for you.
Read more about enabling the awslogs on your Container Instances. Supported logging drivers are listed here.
Log options are used to filter log for the container instance. Read more about log options
Plugin will use provided EFS volume and mount it at /efs
in ec2 instances and in docker containers.
Multiple Amazon EC2 instances can access an EFS
volumes, so it can be used to store credentials for
docker container.
EFS settings is supported only on RPM
based linux operating system. This may get removed
in subsequent releases.


Matlab and DAQ
From Neuromechatronics Wiki
Contents |
daqhwinfo( )
This function, part of the MATLAB Data Acquisition Toolbox, will report the recognized DAQ hardware attached to the computer. To query the Target PC 's hardware, enter the command shown in the screenshots below in the MATLAB console. The response data should match what's shown if your hardware is properly configured.
- National Instruments (nidaq)
- Measurement Computing (mcc)
- Points to note
- AdaptorDllVersion
- The version of MATLAB in parentheses should match that in the AdaptorDllName value. The DLL version is synonymous with the version of the Data Acquisition toolbox, when check hardware compatibility on the Mathworks website. PCI-6602, PCI-6733 and DAS-1200JR cards are all compatible with version 2.14+
- AdaptorName
- The adaptor (driver) used for NI boards in the neuromechatronics experiments is identified as 'nidaq' in MATLAB. This driver is used for "traditional" NI-DAQ API calls, as opposed to the current NI driver, called 'nidaqmx' in MATLAB. If your target PC shows hardware only for 'nidaqmx' and not 'nidaq', you may experience problems with hardware control in the Matlab code.
Frog Lab: daq2axis.m
daq2axis is part of the MATLAB code used to administer muscle stimulation and record muscle forces in the frog lab. It creates a GUI through which the DAQ analog inputs (DAS1200JR) and outputs(PCI-6733) are controlled. In past experiments this code had problems communicating with the DAQ analog output card, identifying multiple instances of it - none of which worked. The following section documents steps taken to fix the DAQ hardware inventory seen by daq2axis, and get the code running.
The problem appeared when clicking the output setup button marked below. Clicking setup tells MATLAB to query the system for available output cards.
The hardware inventory is displayed in the output setup window shown here. Multiple instances of the analog output card are listed.
To fix the card inventory that MATLAB sees, the extra instances of the card should be deleted. This can be done easily in the NI Data and Automation Explorer.
After deleting the redundant devices, the next steps are to 1. reboot the pc and 2. restart MATLAB.
Checking the nidaq cards from the MATLAB console with daqhwinfo('nidaq') should now show the correct inventory.
If the device inventory on the target PC is correct but the card still does not show up as an option in the output setup window, check the the following code:
In getHardware.m (Same directory as daq2axis.m)
- line 80:
- Change
- supported_daqTypes = {'mcc','winsound','ni'};
- To
- supported_daqTypes = {'mcc','winsound','ni', 'nidaq' };
It might also be worth setting a breakpoint here in the code and stepping through to make sure that the hardware is recognized.
Traditional NI-DAQ vs NI-DAQmx
Some of the lab MATLAB code that communicates with the DAQ cards produces warnings (not errors) in the console like the following:
Warning: Support for the National Instruments Traditional NI-DAQ driver will not be provided in future releases of Data Acquisition Toolbox. Instead, it will be available as a separate download. Consider upgrading to the NI-DAQmx version if it supports your hardware. See Solution 1-5LI9NF for details.
This warning appears because the neuromechatronics MATLAB code was written using the Traditional NI-DAQ (Legacy) API, available in NI-DAQ 7.04 and earlier. It does not affect the performance of the code on the existing rig setups, though updates to MATLAB and/or the DAQ hardware will require code modifications to use the new NI-DAQmx driver.
- Read more about Solution 1-5LI9NF (Mathworks site)


Struct Maybe<T>
Represents a value of type T
which may or may not be assigned.
Inherited Members
Namespace: THNETII.Common
Assembly: THNETII.Common.dll
Syntax
public struct Maybe<T> : IEquatable<Maybe<T>>, IEquatable<T>
Type Parameters
| Name | Description |
|---|---|
| T | The underlying value type of the Maybe<T> generic type. |
Remarks
This type is similar to the Nullable<T> type, but also allows for marking a reference as unset.
Constructors
| Improve this Doc View SourceMaybe(T)
Initializes a new Maybe<T> structure to the specified value.
The HasValue property of the new structure will evaluate to true
.
Declaration
public Maybe(T value)
Parameters
| Type | Name | Description |
|---|---|---|
| T | value | The value of the initialized Maybe<T> structure. |
Properties
| Improve this Doc View SourceHasValue
Gets a value indicating whether the Maybe<T> has a valid value of its underlying type.
Declaration
public bool HasValue { get; }
Property Value
| Type | Description |
|---|---|
| Boolean |
|
NoValue
Gets a Maybe<T> value where the value of T
is unset.
Declaration
public static Maybe<T> NoValue { get; }
Property Value
| Type | Description |
|---|---|
| Maybe<T> | The default value of the Maybe<T> structure. |
Value
Gets or sets the underlying value of the Maybe<T> structure.
Declaration
public T Value { get; set; }
Property Value
| Type | Description |
|---|---|
| T | A value of the underlying type of the Maybe<T> structure. |
Remarks
Exceptions
| Type | Condition |
|---|---|
| InvalidOperationException | The HasValue property is |
Methods
| Improve this Doc View SourceClear()
Clears the assigned underlying value (if any) and sets the HasValue
property to false
.
Declaration
public void Clear()
Equals(T)
Determines whether the current instance is equal to the specified value.
Declaration
public bool Equals(T otherValue)
Parameters
| Type | Name | Description |
|---|---|---|
| T | otherValue | The value of type |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Equality between a Maybe<T> and a value of type T
is commutative and determined by satisfying all of the following criteria:
- The HasValue of the Maybe<T> value returns
true
. - The Value property of the Maybe<T> value is equal to the value of type
T
.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
Equals(Object)
Determines whether the current instance is equal to the specified object.
Declaration
public override bool Equals(object obj)
Parameters
| Type | Name | Description |
|---|---|---|
| Object | obj | The object to compare to. |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Overrides
Remarks
Equality between two Maybe<T> values is determined by satisfying any of the following criteria:
- The HasValue of both Maybe<T> values returns
false
. - The HasValue of both Maybe<T> values returns
true
and
the Value property of both Maybe<T> is equal.
Equality between a Maybe<T> and a value of type T
is commutative and determined by satisfying all of the following criteria:
- The HasValue of the Maybe<T> value returns
true
. - The Value property of the Maybe<T> value is equal to the value of type
T
.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
Equals(Maybe<T>)
Determines whether the current instance is equal to the specified Maybe<T>.
Declaration
public bool Equals(Maybe<T> otherMaybe)
Parameters
| Type | Name | Description |
|---|---|---|
| Maybe<T> | otherMaybe | The Maybe<T> to compare to. |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Equality between two Maybe<T> values is determined by satisfying any of the following criteria:
- The HasValue of both Maybe<T> values returns
false
. - The HasValue of both Maybe<T> values returns
true
and
the Value property of both Maybe<T> is equal.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
GetHashCode()
Returns a hash code for the current instance.
Declaration
public override int GetHashCode()
Returns
| Type | Description |
|---|---|
| Int32 |
|
Overrides
| Improve this Doc View SourceGetValueOrDefault()
Retrieves the assigned underlying value of the Maybe<T> structure or the default value of the underlying type.
Declaration
public T GetValueOrDefault()
Returns
| Type | Description |
|---|---|
| T | The value of the Value property if the HasValue
property is |
GetValueOrDefault(T)
Retrieves the assigned underlying value of the Maybe<T> structure or the specified default value.
Declaration
public T GetValueOrDefault(T default)
Parameters
| Type | Name | Description |
|---|---|---|
| T | default | The value to return if the HasValue is |
Returns
| Type | Description |
|---|---|
| T | The value of the Value property if the HasValue
property evaluates to |
ToString()
Declaration
public override string ToString()
Returns
| Type | Description | ||||||
|---|---|---|---|---|---|---|---|
| String |
|
Overrides
Operators
| Improve this Doc View SourceEquality(T, Maybe<T>)
Determines whether a Maybe<T> value is equal to a value of type T
.
Declaration
public static bool operator ==(T value, Maybe<T> maybe)
Parameters
| Type | Name | Description |
|---|---|---|
| T | value | The comparand of type |
| Maybe<T> | maybe | The Maybe<T> comparand. |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Equality between a Maybe<T> and a value of type T
is commutative and determined by satisfying all of the following criteria:
- The HasValue of the Maybe<T> value returns
true
. - The Value property of the Maybe<T> value is equal to the value of type
T
.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
See Also
| Improve this Doc View SourceEquality(Maybe<T>, T)
Determines whether a Maybe<T> value is equal to a value of type T
.
Declaration
public static bool operator ==(Maybe<T> maybe, T value)
Parameters
| Type | Name | Description |
|---|---|---|
| Maybe<T> | maybe | The Maybe<T> comparand. |
| T | value | The comparand of type |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Equality between a Maybe<T> and a value of type T
is commutative and determined by satisfying all of the following criteria:
- The HasValue of the Maybe<T> value returns
true
. - The Value property of the Maybe<T> value is equal to the value of type
T
.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
See Also
| Improve this Doc View SourceEquality(Maybe<T>, Maybe<T>)
Determines whether two Maybe<T> values are equal.
Declaration
public static bool operator ==(Maybe<T> left, Maybe<T> right)
Parameters
| Type | Name | Description |
|---|---|---|
| Maybe<T> | left | The conversion tuple instance on the left side of the operator. |
| Maybe<T> | right | The conversion tuple instance on the right side of the operator. |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Equality between two Maybe<T> values is determined by satisfying any of the following criteria:
- The HasValue of both Maybe<T> values returns
false
. - The HasValue of both Maybe<T> values returns
true
and
the Value property of both Maybe<T> is equal.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
See Also
| Improve this Doc View SourceExplicit(Maybe<T> to T)
Casts the Maybe<T> value to a value of type T
.
Declaration
public static explicit operator T(Maybe<T> maybe)
Parameters
| Type | Name | Description |
|---|---|---|
| Maybe<T> | maybe | The Maybe<T> to cast. |
Returns
| Type | Description |
|---|---|
| T | The Value of |
Exceptions
| Type | Condition |
|---|---|
| InvalidCastException |
|
Implicit(T to Maybe<T>)
Implicityly casts a value of type T
to a Maybe<T> value.
Declaration
public static implicit operator Maybe<T>(T value)
Parameters
| Type | Name | Description |
|---|---|---|
| T | value | The value of type |
Returns
| Type | Description |
|---|---|
| Maybe<T> | A Maybe<T> whose HasValue property is |
See Also
| Improve this Doc View SourceInequality(T, Maybe<T>)
Determines whether a Maybe<T> value is not equal to a value of type T
.
Declaration
public static bool operator !=(T value, Maybe<T> maybe)
Parameters
| Type | Name | Description |
|---|---|---|
| T | value | The comparand of type |
| Maybe<T> | maybe | The Maybe<T> comparand. |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Inequality between a Maybe<T> and a value of type T
is commutative and determined by satisfying any of the following criteria:
- The HasValue of the Maybe<T> value returns
false
. - The Value property of the Maybe<T> value is not equal to the value of type
T
.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
See Also
| Improve this Doc View SourceInequality(Maybe<T>, T)
Determines whether a Maybe<T> value is not equal to a value of type T
.
Declaration
public static bool operator !=(Maybe<T> maybe, T value)
Parameters
| Type | Name | Description |
|---|---|---|
| Maybe<T> | maybe | The Maybe<T> comparand. |
| T | value | The comparand of type |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Inequality between a Maybe<T> and a value of type T
is commutative and determined by satisfying any of the following criteria:
- The HasValue of the Maybe<T> value returns
false
. - The Value property of the Maybe<T> value is not equal to the value of type
T
.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.
See Also
| Improve this Doc View SourceInequality(Maybe<T>, Maybe<T>)
Determines whether two Maybe<T> values are not equal.
Declaration
public static bool operator !=(Maybe<T> left, Maybe<T> right)
Parameters
| Type | Name | Description |
|---|---|---|
| Maybe<T> | left | The conversion tuple instance on the left side of the operator. |
| Maybe<T> | right | The conversion tuple instance on the right side of the operator. |
Returns
| Type | Description |
|---|---|
| Boolean |
|
Remarks
Inequality between two Maybe<T> values is determined by satisfying any of the following criteria:
- The HasValue property of one Maybe<T> value is
true
while the other isfalse
. - The HasValue of both Maybe<T> values returns
true
and
the Value property of of one Maybe<T> is not equal to the other.
If T
implements IEquatable<T>,
Value is compared using the Equals(T) method.
Otherwise, Equals(Object) is used.


This web server is a part of the Mopidy music server. To learn more about Mopidy, please visit www.mopidy.com.
Web clients which are installed as Mopidy extensions will automatically appear here.


WebSocket Client
URL:
Connect
Disconnected
Send
Sent
Timestamp
Message
Received
Timestamp
Message
Log
Timestamp
Message


public abstract class TrcPixyCam1
extends java.lang.Object
| Modifier and Type | Class and Description |
|---|---|
class |
TrcPixyCam1.ObjectBlock
This class implements the pixy camera object block communication protocol.
|
static class |
TrcPixyCam1.RequestId
This is used identify the request type.
|
| Modifier and Type | Field and Description |
|---|---|
protected TrcDbgTrace |
dbgTrace |
protected static boolean |
debugEnabled |
protected static java.lang.String |
moduleName |
protected static TrcDbgTrace.MsgLevel |
msgLevel |
protected static TrcDbgTrace.TraceLevel |
traceLevel |
protected static boolean |
tracingEnabled |
protected static boolean |
useGlobalTracer |
| Constructor and Description |
|---|
TrcPixyCam1(java.lang.String instanceName,
boolean msbFirst)
Constructor: Create an instance of the object.
|
| Modifier and Type | Method and Description |
|---|---|
abstract void |
asyncReadData(TrcPixyCam1.RequestId requestId,
int length)
This method issues an asynchronous read of the specified number of bytes from the device.
|
void |
asyncWriteBytes(byte[] data)
This method writes the data to the device one byte at a time.
|
abstract void |
asyncWriteData(TrcPixyCam1.RequestId requestId,
byte[] data)
This method writes the data buffer to the device asynchronously.
|
void |
end()
This method sets the pixy camera to end state so it will start properly next time.
|
TrcPixyCam1.ObjectBlock[] |
getDetectedObjects()
This method returns an array of detected object blocks.
|
void |
requestHandler(java.lang.Object context)
This method is called when the read request is completed.
|
void |
setBrightness(byte brightness)
This method sets the camera brightness.
|
void |
setLED(byte red,
byte green,
byte blue)
This method sets the LED to the specified color.
|
void |
setPanTilt(int pan,
int tilt)
This method sets the pan and tilt servo positions.
|
void |
start()
This method starts the pixy camera by queuing the initial read request if not already.
|
java.lang.String |
toString()
This method returns the instance name.
|
protected static final java.lang.String moduleName
protected static final boolean debugEnabled
protected static final boolean tracingEnabled
protected static final boolean useGlobalTracer
protected static final TrcDbgTrace.TraceLevel traceLevel
protected static final TrcDbgTrace.MsgLevel msgLevel
protected TrcDbgTrace dbgTrace
public TrcPixyCam1(java.lang.String instanceName, boolean msbFirst)
instanceName
- specifies the instance name.msbFirst
- specifies true if a word has MSB first.public abstract void asyncReadData(TrcPixyCam1.RequestId requestId, int length)
requestId
- specifies the ID to identify the request for the request handler. Can be null if none was
provided.length
- specifies the number of bytes to read.public abstract void asyncWriteData(TrcPixyCam1.RequestId requestId, byte[] data)
requestId
- specifies the ID to identify the request for the request handler. Can be null if none was
provided.data
- specifies the data buffer.public java.lang.String toString()
toString
in class java.lang.Object
public void start()
public void end()
public void asyncWriteBytes(byte[] data)
data
- specifies the buffer containing the data to be written to the device.public void setLED(byte red, byte green, byte blue)
red
- specifies the red value.green
- specifies the green value.blue
- specifies the blue value.public void setBrightness(byte brightness)
brightness
- specifies the brightness value.public void setPanTilt(int pan, int tilt)
pan
- specifies the pan position between 0 and 1000.tilt
- specifies the tilt position between 0 and 1000.public TrcPixyCam1.ObjectBlock[] getDetectedObjects()
public void requestHandler(java.lang.Object context)
context
- specifies the read request.


One of the areas of software development where Ruby really shines is web development. From creating a simple website to a full cloud based webservice, it is all easily attainable.
I should mention Ruby on Rails. You have been learning the Ruby language, how to speak it. But Rails is a very powerful and popular toolkit for building websites.
Ruby-on-rails, or RoR, consists of set of Ruby libraries. These libraries help you do things that websites commonly need. Like routing an incoming request to the correct handler. Or interacting with the database. Or returning a fully rendered webpage.
RoR makes creating a website easy, if you follow the RoR conventions. This also means that you do not have to setup a lot of complicated stuff in order to get RoR to work. RoR people call this principle convention over configuration.
One important convention is called: Model-View-Controller (for purists it is a design pattern). It means that you should separate code for: business logic (the model), rendering webpages (the view) and connecting stuff (the controller).
If you’re interested in learning about Rails, I would head over there right away. Start using your Ruby skills proper!
One disadvantage of RoR is that, because there are so many libraries and conventions, it takes a while to learn RoR.
There are several other Ruby web frameworks that are simpler and easier to learn:
This is just a short list of all frameworks that are available. Some searching should give you many more options.


--- title: Smartphone Repair Ottawa - Cellphone Repair Shop layout: default bodyClass: page-home ---
Smartphone Repair Ottawa offers you the best repair services of high quality and with highly qualified technicians. Our staff is constantly updated to provide you with a better service. Don't waste your time looking for cheap low quality solutions, you can be sure that at Smartphone Repair Ottawa we use quality product for your repairs and at a super price.
In addition to helping you with your phone repairs, at Smartphone Repair Ottawa we repair your laptop, PC, and tablet. And not only that! We also offer protection accessories for your device, so you never have to go through the repair process again. We also have sales of high-tech cellphones, so you can carry out your activities with greater comfort.
We know that when it comes to your phone, tablet, computer or any personal device, trust is a top concern. But don't worry, trust Smartphone Repair Ottawa, we have the necessary sources to provide you with quality service at an excellent price, not to mention how friendly our team is, you will have an unforgettable experience. That is why we want Smartphone Repair Ottawa to be your first option when making your repair, purchase of accessories or phones. You will not regret!


setBaseAndExtent example
Fish
Dog
Cat
Bird
MIDDLE
Car
Bike
Boat
Plane
Anchor offset
Focus offset
Capture selection
Output
:


--- tags: - 特殊-位运算 - DP-记忆化搜索 grammar_cjkRuby: true catalog: true layout: post header-img: "img/header/P27.jpg" preview-img: "/img/preview/P27.jpg" ---
标签：记忆化搜索，模拟，位运算
You are given n stringss1, s2, ..., sn consisting of characters 0 and 1.m operations areperformed, on each of them you concatenate two existing strings into a new one.On thei-th operation the concatenationsaisbiis saved into a new stringsn + i(the operations are numbered starting from 1). After each operation you need tofind the maximum positive integerk such that all possible stringsconsisting of 0 and 1 of lengthk (there are 2k suchstrings) are substrings of the new string. If there is no suchk, print 0.
Input
The first line contains single integern(1 ≤ n ≤ 100) — thenumber of strings. The nextn lines contain stringss1, s2, ..., sn (1 ≤ |si| ≤ 100), one per line. The total length of strings is not greater than 100.
The next line contains single integerm(1 ≤ m ≤ 100) — thenumber of operations.m lines follow, each of them contains two integersai abdbi (1 ≤ ai, bi ≤ n + i - 1) — the number of strings that areconcatenated to formsn + i.
Output
Print m lines, each should containone integer — the answer to the question after the correspondingoperation.
Example
Input
5
01
10
101
11111
0
3
1 2
6 5
4 4
Output
1
2
0
Note
On the first operation, a new string "0110"is created. Fork = 1 the two possiblebinary strings of lengthk are "0" and "1", they aresubstrings of the new string. Fork = 2 and greater there exist strings of lengthk that do notappear in this string (fork = 2 such string is "00"). So the answer is 1.
On the second operation the string "01100"is created. Now all strings of lengthk = 2 are present.
On the third operation the string "1111111111"is created. There is no zero, so the answer is 0.
题意：给定n个01字符串，进行m次操作，每次将Sa,Sb，两个字符串合并成为新串Sn+i
求：对于每个新和成的字符串，存在数字k，满足长度为k的01字符全排列都存在于新和成的字符串的子串中，询问k的最大值
分析：
直接模拟就好了，注意求出的每个ans，一定要存储下来，记忆化使用，01字符全排列可以使用位运算加速，不会TLE
代码中取头尾各500，防止MLE
我们合并两个字符串的时候，对答案产生贡献的部分就是两者中间衔接部分
所以我们可以只记录每个字符串的头和尾作为特征来更新答案
对于这种做法答案的正确性，可以有递推式ans[n+i]=max(max(ans[l],ans[r]),work(n+i))保证，满足答案递增（是部分递增，不是全局递增），貌似可以有严谨（xuan xue）的数学证明但是本蒟蒻不会啊，大家有数据也可以hack。
Code
#include<bits/stdc++.h> #define rep(i,a,b) for(int i=a;i<=b;i++) #define dep(i,a,b) for(int i=a;i>=b;i--) #define mem(x,num) memset(x,num,sizeof x) using namespace std; const int maxn=206; int ans[maxn],n,m,l,r; string s[maxn]; int work(int x){ rep(i,1,10) rep(j,0,(1<<i)-1){ string t; rep(k,0,i-1){ if(j&(1<<k))t+='1'; else t+='0'; } if(s[x].find(t)==-1)return i-1; } } int main() { scanf("%d",&n); rep(i,1,n)cin>>s[i]; scanf("%d",&m); rep(i,1,m){ scanf("%d%d",&l,&r); s[n+i]=s[l]+s[r]; if(s[n+i].length()>1000)s[n+i]=s[n+i].substr(0,500)+s[n+i].substr(s[n+i].length()-500,500); ans[n+i]=max(max(ans[l],ans[r]),work(n+i)); cout<<ans[n+i]<<endl; } return 0; }


December 6th 2017 - Tejpal Virdi
Introduction
Recently, Ulyanov et. al introduced a paper titled “Deep Image Prior,” describing how a great deal of image information can be captured simply by the structure of a convolutional neural network. They use this inherent nature of ConvNets to perform various image restoration problems, where the “prior” is needed to restore the lost information. Rather than learning from a set of images, this technique demonstrates that the CNN itself encapsulates the image. This is notable since most previous attempts to solving problems in single-image super-resolution, denoising, and inpainting all required the use of large datasets or complex algorithms. In this post, we show how this methodology can be used to enhance the quality of noisy audio samples.
Deep Image Prior
As briefly mentioned in the introduction, Deep Image Prior utilizes the fact that the generator network itself has the answer to the restoration problem. Thus, the solution set is in the network’s parameters rather than the general image space. This motivates the development of new deep learning architectures that are domain-fitted for improved accuracy. Here are some results from the original paper:
Audio
Audio is commonly generated as a WAV file, which contains the pure signal of the audio. However, since that is extremely dense and large, we must convert it into a representation that would reduce computational expense. Specifically, audio can be visually represented in terms of a spectrogram, which shows the distribution of frequency over time. As an image, it is not lower in dimensionality and we can use a plain old ConvNet to learn from it. (Note: Recurrent Neural Network architectures are more often used with audio since previous states/history tends to have an effect on the current state )
Methods and Results
We employ a DCGAN trained on one degraded image. Throughout the training, we sample its outputs. Here are the network’s outputs over ~2000 iterations:
As seen in the figure, the network is initialized with random weights and learns the different features of the degraded image. The network, however, does not learn the noise of the spectrogram so the generated images are of higher quality than the input degraded image, as seen below:
Implementation available here


Question 1: The correct answer is the Philip WHITTINGHAM.
Question 2: The correct answer is David Clive BENNETT.
Question 3: The correct answer is Peter James BROADLEY.
Question 4: The correct answer is 100.
Question 5: The correct answer is 216.
Question 6: The correct answer is 76.
Question 7: The correct answer is 87.
Question 8: The correct answer is 116.
Question 9: The correct answer is 19.
Question 10: The correct answer is 361.


inspection timer
hide timer
change theme
save solves
load solves
view on github
ao5
-
ao12
-
aoAll
-
PB single
-
00:00.00
Press SPACE to start/stop the timer
Press ENTER to save session


Short URL Creation
example: POST [project_url]/api/shorturl/new - https://www.google.com
Example Usage:
[this_project_url]/api/shorturl/YhevgBhLe should send you to Google!
example: POST [project_url]/api/shorturl/new - https://www.google.com
[this_project_url]/api/shorturl/YhevgBhLe should send you to Google!


Dashboard
Receiving logs
CouncilMen:
(Raw logs)
Receiving logs
CouncilStaff:
(Raw logs)
Receiving logs
Other Auth:
(Raw logs)


You are about to take the {{ assessment_title|safe }}. Please keep these things in mind:
{% if assessment_name != 'Final' %}
- You will have THREE hours in which to take this exam.
{% else %}
- You will have FIVE hours in which to take this exam.
{% endif %}
- You may NOT enter the exam, save your work, and return later. (That
is, if you click to begin, you should be prepared to take the exam
now).
- You may submit the exam TWICE within the exam period.
- Of those two submissions, the HIGHEST score will be recorded.
- You will see your score immediately after you take the exam.
{% if assessment_name != 'Final' %}
- You must score an 80% or higher, and complete your wikifolio, in
order to earn the Expertise badge for this section of the course.
{% else %}
- You must score 70% or higher, and have earned all three Expertise
badges, to earn the final badge of the course.
{% endif %}
- Yes, this is an open book exam.
- The exam software DOES NOT WORK with Internet Explorer 7 or
earlier. You can check what version you're using here.
If you don't have access to any other browser, or if you have other
trouble, contact us at the e-mail address below.
Please be sure you are ready to take the exam before you open it!


WITNESS LIST Finance Committee March 29, 1999-9:00A SB 672 THIS LIST HAS NO WITNESSES. SB 762 ON: Pinkley, Craig (Texas Department of Economic Development), Austin SB 1319 FOR: Allaway, Bill (Texas Taxpayers & Research Association), Austin ON: Barton, Karey (Office of Comptroller of Public Accounts), Austin Hamilton, Billy (Office of Comptroller of Public Accounts), Austin SB 1320 ON: Greenwade, Rowland (Office of Comptroller of Public Accounts), Austin SB 1321 ON: Hamilton, Billy (Office of Comptroller of Public Accounts), Austin Koebele, Steve (Office of Comptroller of Public Accounts), Austin LeBas, James (Office of Comptroller of Public Accounts), Austin Registering, but not testifying: For: Allaway, Bill (Texas Taxpayers & Research Association), Austin Allen, George B. (Texas Apartment Association), Austin Powers, Bill (Texas Farm Bureau), Austin Roberts, Jack (Texas Society of Certified Public Accountants), Austin SB 1488 FOR: Allaway, Bill (Texas Taxpayers & Research Association), Austin ON: Barton, Karey (Office of Comptroller of Public Accounts), Austin Hamilton, Billy (Office of Comptroller of Public Accounts), Austin Cancer Council On: Jacobs, Mickey L. (Texas Cancer Council), Austin Comm.for Deaf & Hard of Hearing THIS LIST HAS NO WITNESSES. Commission for the Blind On: Murphy, Terry (Texas Commission for the Blind), Austin Commission on Alcohol & Drug Abuse On: Bleier, Terry Faye (Commission on Alcohol & Drug Abuse), Austin Smock, Mark (Commission on Alcohol & Drug Abuse), Austin Young, Cecile (Governor's Office of Budget & Planning), Austin Department on Aging THIS LIST HAS NO WITNESSES. Texas Rehabilition Commission On: Arrell, Vernon "Max" (Texas Rehabilitation Commissio), Austin


Hi master thank you for challening me but this is no challange if i did this within a day. now play my victory song


Something about web crawler
This post shows details of the some web crawler. These methods are all what I used in some project. All of them are written with python. You can go to the specific website by link.
A easy crawler
- Link: https://github.com/hjw99868/easy_spider
- Tools & Language: Scrapy & python2
This is the first web crawler I have writen. It is very easy for someone who is familiar with web crawler. But it’s a good program for a new comer.
If you want to learn web crawler, I think scrapy is a very good thing to learn first. Scrapy is an open source and collaborative framework for extracting the data you need from websites ,fo course, in a fast, simple, yet extensible way. You only need to learn a little python before use scrapy. Here is a very good document of scrapy in Chinese or in English.


Copyright © since 2006 MassBank Project
Copyright © since 2011
NORMAN Association
Copyright © since 2017
MassBank Consortium
Responsible: Dr. Tobias Schulze
(tobias.schulze@ufz.de)


About chart:
1. Use ExcelFormattedGISTEMPData.js as data source.
2. x : year of that decade ; y : annual mean (Jan-Dec) ; Each circle represents a data pair.
3. Use different color on each line which corresponds to a decade (subset 1).
4. Group 4 neighbor decades (subset 2), and use similar but distinguishable color on them.
5. Click on each decades label may hide/display that decades line.
6. Hover on the circles to see the exact ( year, annual mean) info.
7. From color groups: Blue (1880~1919), Orange (1920~1959), Green (1960~1999), Purple (2000~2014) , there's a increasing trend by time.
8. The increment between decades is also increasing.


In each period, you may buy permits at auction, and the prices paid for these permits will be added to your costs. All producers will be obtaining their permits through the auction. In this session, there are {{session.config.num_demo_participants}} producers.
There is a limited supply of permits for sale at auction. The number of permits for sale will start at {{session.config.initial_cap}} in the first period and will fall by {{session.config.cap_decrement}} each subsequent period.
In each period's auction, you will be able to make a number of bids for permits, and for each permit bid, you will specify a price that is the maximum that you are willing to pay in the auction for that permit. You may bid different values for each bid that you make. As the supply of permits falls over time, fewer will be available to buy at auction.
The bids will be sorted from high to low, and orders will be filled in that order until the available supply is exhausted. All permits will be sold in the auction at a single uniform price. The price is set to the value of the first bid that is not filled, that is, the first rejected bid. So, for example, if there are 4 permits for sale, and the bids are $10, $9, $8, $8,and $6, the first four bids will be successful and the last bid will be rejected. The price the winning bidders pay will be $6, the value of the first rejected bid. Note that the winning bids will generally be higher than (or possibly equal to) the price actually paid for the permits. Ties will be resolved by a random device.
The auction will have a reserve price of {{ Constants.reserve_price }}. No bids below this amount will be allowed. Any permits not sold at the auction (if there are any) will simply be retired and will not be sold at a later time.


Ask questions about the core tech here, but not questions about prices or personal questions or GUI and please don't DM JL777.
https://dexstats.info/richlistlookup.php?address=RLVzC4tr9cNKvuw2z4m8KuMfZURwCehx55
https://medium.com/@jameslee777
100 messages
Before 05-Dec-19 12:00 AM
allbits21-Jun-19 09:18 PM
Maybe after you've finished this first stage of programmable, secure, interoperable blockchains, you can get to this other level - unless you decide to take your nine wives yachting on your private jet with caviar
grewalsatinder21-Jun-19 09:20 PM
that's interesting question. Never came to my mind
haven't heard of this way anywhere before either
jl777c21-Jun-19 09:20 PM
ok, i will make a PR to bitcoin legacy devs to add CC
nope, they said progress will not be allowed on BTC
2
2
phm8721-Jun-19 09:20 PM
I'd support this PR
jl777c21-Jun-19 09:21 PM
you can nest multisigs in a way using p2sh scripts
grewalsatinder21-Jun-19 09:21 PM
that's cool!
jl777c21-Jun-19 09:22 PM
@allbits the problem is i fall asleep when reading math papers
makes it hard to fully understand them
3
@Deleted User bitcoin script has a rudimentary control flow, if,elif,elif,...else
inside each one you can put in whatever other
so that can construct a fairly complex redeem mechanism
grewalsatinder21-Jun-19 09:26 PM
I hated maths class. never found it interesting.... now I need maths for higher tasks... can't do much now
allbits21-Jun-19 09:31 PM
When I think about this from my non technical POV, I think an interesting part is "and no-one else can control the address". To me, this brings up the issue of where does the DAO run code. The only conceivable answer, is an account on a decentralized computer or something like that. So we're still a long way away.
ph03nix22-Jun-19 05:36 AM
this might be a personal question, but i was wonderig why you don't click emoji responses
i've see a rare and
but never clicked on response emoji
jl777c22-Jun-19 05:39 AM
i dont speak emoji very well
3
ph03nix22-Jun-19 05:40 AM
willofleo22-Jun-19 10:20 AM
had a quick read again on that interesting convo you said @jl777c (even without me, the revshare is changed to a new address and whoever controls that would be able to distribute out the funds) . or not right ? they may not or is there away to avoid malicious ownership after you. very common in corporate world where funds are mismanaged I know the convo has passed , but nice to see a solution to this thought of
jl777c22-Jun-19 10:25 AM
it is controlled by the source code repos
1
Zoroaster22-Jun-19 04:54 PM
Is Agama officially dead? And if so, will there ever be a KMD ecosystem wallet simple enough for dummies like me to use? Simple enough for my grandma to use? Thanks
Community driven open source CPU mineable cryptocurrency with 50/50 Proof-of-Work/Proof-of-Stake, zk-SNARK zero-knowledge proof privacy.
PTYX23-Jun-19 05:25 AM
What do you think of Elixxir?
Seko23-Jun-19 01:56 PM
How safe do you think the ledger is? Especially with regard to privacy? Do you think Ledger logs the addresses and can assign them to a user?
I'm currently wondering how anonymous is Ledger? After all, the Hardware Wallet is ordered and paid for with KYC!
jl777c23-Jun-19 02:06 PM
not sure if the hardware id is sent with the requests to their servers
but all tx by ledger needs their servers to provide the rawtx to sign
which means ip addresses can be logged and if they are keeping logs, and USSA demands they divulge it, likely to avoid being waterboarded, they will divulge what info they have
thinking about this, it would not be surprising if ledger wasnt forced to log the hardware id, if they werent
but i have no actual knowledge about this, just guessing that they can easily be forced to log all this and divulge all the details, in fact with the recent FATF they are likely forced to divulge all such data to chainanalysis
it is best to use a dedicated full node!
still it can be monitored externally, but at least you are not handing it on a silver platter
tryx23-Jun-19 02:16 PM
Hello, Just made a "lost founds -5 June" request, I've added a new address from Binance. Is that ok ? or I have to redo the request and put a walled address. Thanks!
wallet*
jl777c23-Jun-19 02:17 PM
any valid address is fine, the important thing is that it matches the address you send to from the old address
a small amount was sent to all the compromised addresses. send it to the new address you claimed
tryx23-Jun-19 02:17 PM
ok, thanks , will get right on that
grewalsatinder23-Jun-19 05:05 PM
@jl777c would it ever be possible to think that High Frequency Trading will be possible over Decentralised Exchanges?
cipi23-Jun-19 05:07 PM
i think it depends mainly on the blocktime of the involved coins... so BTC is out
jl777c23-Jun-19 05:39 PM
not the millisecond trading, one minute would be the fastest possible and that is nowhere near fast enough to count as HFT
Provided to YouTube by Believe SAS Blue Noise · Gerra & Stone Point of Origin, Vol. 3 Shogun Audio Released on: 2018-10-19 Author: David Stone Composer: Da...
I'd say B. The bulldozing rhino
rainbro723-Jun-19 08:31 PM
Thank you JL777 and company for your prompt response in regards to the attack!
차미숙24-Jun-19 03:43 AM
James, are you giving out kmd dividends to supernet shareholders by any chance? Seems like a good way to support shareholders.
If supernet can create consistent crypto flow regardless of the market condition, seems like a good way.
And that will create sort of a base line for valuating intrinsic value of an asset for the future buyer too
Maybe like once in three months quarterly?
jl777c24-Jun-19 04:58 AM
the design is for the investments to pay for the operating expenses and the revshare assets to create the revshares
차미숙24-Jun-19 06:52 AM
I see
Seko24-Jun-19 11:33 AM
Thank you. I'm not accusing ledgers of evil, but the point is. They can be forced. So as anonymous as some people think, the ledger may not be at all.
For PIRATE we need a pirate hardware wallet.
Hegelian24-Jun-19 03:48 PM
Hi James, what OS do you recommend?
phm8724-Jun-19 04:04 PM
About logs of ledger, the question was asked (on the french CryptoFr slack) to Btchip the CTO of Ledger. He replied: "on a pas de logs, mais bon par définition, on ne peut pas prouver qu'on a pas de logs, donc enjoy :tournesol:"
Translation: " we [ledger] have no logs, but by definition, we cannot proove that we have no logs, so enjoy "
1
@Seko
jonnybbig24-Jun-19 07:40 PM
@Seko I agree we need arrr wallet but I was thinking paper wallet was the most secure? I used one for 1/2 my bag a while back
Is that safe as a pirate hardware wallet in your opinion?
Pirate Sapling Paper Wallet Generator. Contribute to lilszi/piratepaperwallet development by creating an account on GitHub.
But I have to admit, I haven't tried it yet. Yes, probably safer.
1
jonnybbig24-Jun-19 07:54 PM
Awesome that’s what I used
Mylo25-Jun-19 01:29 AM
Is it possible to use pubkey when broadcasting to peers to identify a peer to a peer atm?
Use it for creating a node map of full nodes. If there’s another way, other than registering ip, what is it?
Opt-in
jl777c25-Jun-19 06:07 AM
nodes send a message when making first contact, you could change your name to your pubkey. that would be minimal changes
Mylo25-Jun-19 02:27 PM
Ok thanks
Kinji26-Jun-19 01:59 AM
Hi @jl777c
ohweoh26-Jun-19 01:51 PM
@jl777c is the Antara framework the only reveal from the upcoming rebrand? Also, is there anything to the IBM partnership? Thanks
jl777c26-Jun-19 01:51 PM
IBM partnership appears to have been some imposters
at least when we checked with IBM, they had no knowledge of them
ohweoh26-Jun-19 02:19 PM
Thanks. Has the AWS partnership been formally announced?
1
jl777c26-Jun-19 02:21 PM
we are listed on the AWS site at the highest level of the partnership
Markus26-Jun-19 07:11 PM
@jl777c before u started getting into blockchain what did u do for a living?
jl777c26-Jun-19 07:12 PM
i coded in C
Markus26-Jun-19 07:12 PM
for a company or by ur own?
jl777c26-Jun-19 07:14 PM
too personal a question
Markus26-Jun-19 07:14 PM
Alright sry
Is there any person who inspired u in any kind of way?
jl777c26-Jun-19 07:16 PM
i just like to make C code that solves problems
and am pretty stubborn
3
grewalsatinder26-Jun-19 07:16 PM
@jl777c would you call yourself a polymath like Satoshi Nakamoto was ?
jl777c26-Jun-19 07:17 PM
yes
grewalsatinder26-Jun-19 07:17 PM
was expecting, but just wanted to confirm
That is why you think through so clearly in so many complex situations about many things relating this tech and economics.
jl777c26-Jun-19 07:19 PM
its all a math of some type
grewalsatinder26-Jun-19 07:19 PM
true
jl777c26-Jun-19 07:20 PM
also i dont really think through things that often, mostly it is just intuitive and i just have a decent idea of what the solution must be, usually pretty immediate. the hard work is to get it to actually work and then iterate(edited)
grewalsatinder26-Jun-19 07:20 PM
but still I see the charts and tradings all, it still needs a lot of experience understanding them and seeing what it means, if I get that understanding correct....
jl777c26-Jun-19 07:20 PM
but that is probably just the extensive experience i have, as most problems map to other things i have done in the past
grewalsatinder26-Jun-19 07:21 PM
i.e huge past experience
jl777c26-Jun-19 07:22 PM
77 years worth of coding does go a long way
3
grewalsatinder26-Jun-19 07:23 PM
it sure does
phm8726-Jun-19 07:23 PM
Are you 77 years old ? Or less because you work 16 hours per day ?
grewalsatinder26-Jun-19 07:23 PM
still has just 700 years to go
jl777c26-Jun-19 07:24 PM
i am saying i probably have written code that would take most coders 77 years to do
1
3
phm8726-Jun-19 07:24 PM
(And most dev time in companies is wasted. Unions said that on 8 working hours, we work about 3, in companies)