@wdlkmpx  said, "As far as I can tell, there are two types of puppy users:"
"Use the adrv Luke, use the adrv."
If the user gui apps are in an adrv, (like browser, office stuff etc...)
Then it's possible to have sevreral adrv's, a skinny one and a fat one, and another fat one.
Why it might even be possible to have an app that allows users to build their own adrv by selecting from availabe apps.
If the puppy...sfs does not contain any "bloat" apps, then it's not worth removing any thing from it.
For many years it was an annoyance to me that the seamonkey I never used was copied into ram at every boot (wasting my precious ram), but the firefox I always used was left out there on disk.


yes, beat me to this...

however, does this mean that the test 24 in modules/cache_rbtree/cache-logic.unlang also
needs some renaming?


For implementing logging, it became a problem that the `torepr` of `Srcloc`s was nonconformant. `render-error-display.arr` was the only other place I found where the `tostring`/`torepr` behavior was relied on, and I made the [necessary changes](https://github.com/brownplt/pyret-lang/commit/9a7e73968f414e1b03fc175494f2c6e256181a61#diff-0) in this commit.

If you can think of anything else relying on `Srcloc` implementing `_output`, please point me to it.


Double assignment


Test comment


This Looks interesting. Could you add some details, what exactly changed here for the users?


i won't keep it, just want to trigger the CI server to rebuild 😅


这个版本在判断两种贷款方式的时候，部分代码冗余，不干练。


Why?


I can only reproduce this by removing the `org-loaddefs.el` file. It's usually a mistake if that file does not exist, and loading `org` actually causes a warning about that file not being available as you can see below.

```
$ emacs -Q --batch -L . -L ../org/lisp -f batch-byte-compile *.el

In end of data:
hydra.el:1268:1:Warning: the following functions are not known to be defined:
    ring-insert, ring-length, ring-remove
WARNING: No org-loaddefs.el file could be found from where org.el is loaded.
You need to run "make" or "make autoloads" from Org lisp directory

In end of data:
hydra-ox.el:121:1:Warning: the following functions are not known to be
    defined: org-html-export-as-html, org-html-export-to-html,
    org-latex-export-as-latex, org-latex-export-to-latex,
    org-latex-export-to-pdf, org-ascii-export-as-ascii,
    org-ascii-export-to-ascii
```

I occasionally recompile all the packages I have installed in alphabetic order after removing all byte compiled files (to avoid old macro implementations leaking into the newly created byte compiled files).

I think that during byte-compilation we should not depend on a packages autoload file being loaded when the package's "main library" is loaded. While it makes sense that Org does that due to its size, it still is quite unusual.

So you should probably add this to `hydra-ox.el`:

```lisp
(declare-function org-html-export-as-html 'ox-html)
(declare-function org-html-export-to-html 'ox-html)
(declare-function org-latex-export-as-latex 'ox-latex)
(declare-function org-latex-export-to-latex 'ox-latex)
(declare-function org-latex-export-to-pdf 'ox-latex)
(declare-function org-ascii-export-as-ascii 'ox-ascii)
(declare-function org-ascii-export-to-ascii 'ox-ascii)
```

Also note the additional warnings about the `ring` functions. You should add `(require 'ring)` to `hydra.el`.


あああ
ああああ


PyPy supports Python 3.


It's https://github.com/Microsoft/vscode-go/commit/e141a3462e9f1ae1ad0bf6dd9ed849d8439c00e2 that broke it. doc is actually undefined, and == matched undefined, while === doesn't. A mistake on my side, since I intended to ===, and == working is pretty much an accident. Do you want me to issue a PR?


But it doesn't support Python 3.5 at the time....


Crear repo Git


![error_subscribe](https://cloud.githubusercontent.com/assets/15968743/18028267/c6b034e0-6c97-11e6-87d1-639f813ddf36.png)

i am getting error in the save method. subscribe is underlined in red color,when i hover my mouse over it. i get message as "Property 'subscribe' does not exists on type 'void'."

Am i missing anything in the include. I dont find the difference. plz help


PyPy supports only Python 3.3.5 - it is in alpha


For users, the only thing that changed is that the node name field doesn't have any restrictions anymore, any UTF8 string is valid. As written on the mailing list, the `pretty-hostname` CLI utility can be used to query and modify the hostname from the command line.


You sure? From the project page of Nodesource, looks like you're meant to execute said script.


Revert this if there seem to be a real problem with the current approach. :/


PyPy 3 doesn't even have a async support right now..


@TiberiumPY confirmed. Sorry for the misunderstanding. Spiffy is on hold at the moment until we fix RakNet. Thanks for you support and input.


Cool. Thank you.


What do you mean by "For implementing logging, ... nonconformant"?  What do you think outputs are "conforming" to?  Pretty much by definition, values that override _output get to choose what they want those renderings to look like, and they won't _always_ look like function-call syntax.

Your commit message said nothing about what "non-conformity" you were trying to fix, why it was necessary, or what you were trying to achieve.  Srclocs are reported _everywhere_ throughout Pyret; did you check whether any tests might've been affected by this change?  Might anything else have broken?  Equally importantly, as a code reviewer -- where should I be looking to confirm that this change didn't introduce any problems?

Changes like this make me very antsy, without running them past other developers as a sanity check.


https://github.com/maweki/twitchlive-extension/issues/37#issuecomment-242923627

please revert


dfghjhgfdsdfghhgfd


Fixed in 13e9bc8be5e9b252ef0b1f31b161f6e79be7caa6


what have you done to install it so far?


> This is essential for testing gitter integration.

I confirm that


bug, player does not move, it just gos to a pokestop and come back to the first one.

also theres a new pokemon go ban 1,000 pokestop a day (soft ban)

2,000 pokestop a day, permaban


ID 41635 works


Blah blah
`print "hello world"`


But where in the Dockerfile are you executing it? (That's what I meant)


Are you sure it's a good idea to be inconsistent here?


Uck i just downloaded the previous version and was about to complain!


The following doc(s) have been deployed to the [albertperm](https://albertperm-static-docs.pantheonsite.io/docs) Multidev environment:


leaving a comment here - trial


adding a line note here


I don't really get the point though.  I never claimed it was an Elo win, just that there is a logical flaw which correcting is likely not measurable.


Beginner


Sorted out now: 38818ba. Thank you.


Yes, you're right. https://github.com/m6w6/ext-http/issues/27#issuecomment-191649341

I'll look into it, unless there's someone faster with a PR.

Thanks a lot!


rwe


wrr


This was done not so long ago, and was neutral
http://tests.stockfishchess.org/tests/view/578025a50ebc5972faa16740


Link Shortner


aaaaaa


I'd like to think they're they're conforming to the specification provided in the documentation. From the documentation of `torepr`:
> Creates a string representation of the value that resembles an expression that could be used to construct it.

While source locations are used everywhere, stringifying them is not. I spent a non-trivial amount of time making sure this didn't break anything. That included running tests, and as a code-reviewer, that would be a good place to start to ensure this didn't introduce any problems. If I had known this would have made you antsy or if it constituted changing any more than four lines, I would have started a discussion on it.


what is the controversy?


Just fyi, the build fails because the cocoa pod pod spec file isn't updated. Does updating just that file have any consequences (i.e, pushing release out for public)?


@NeoRaider  Actually that there is some C2600 stuff in there is a desired hidden feature? :)


TI CHEGO


wo xiugai


fdfd


dfdsfdsfsfd


@gforcada Jenkins CI reporting about code analysis
See the full report here: http://jenkins.plone.org/job/package-plone.app.z3cform/43/violations
```
plone/app/z3cform/inline_validation.py:15:1: C901 'InlineValidationView.__call__' is too complex (15)
plone/app/z3cform/tests/test_utils.py:21:9: E731 do not assign a lambda expression, use a def
```
Follow [these instructions](https://github.com/plone/jenkins.plone.org/blob/master/docs/source/run-qa-on-package.rst) to reproduce it locally.


fsdf


sdfdsf


fsdfsd


@NoxxDev

Interesting regarding the hatched level being fixed at when the egg is dropped. Never knew.. That means there's no use saving 10 km Eggs indeed.

But - there's still a good reason to save the unlimited incubators!

Right now you cannot save the limited incubators until you reach enough level for them to be useful.. ie above 20ish. The bot will start them all right away and you'll be stuck with only the unlimited one once you start having good use for them.

It's not much use "wasting" limited ones at low levels. You want them to produce high IV mobs once you're at lvl 20. (There's a theory that hatched Pokemons max level is 20 - no use saving anything after that level thus).

Suggestion: add a switch UseEggLimitedIncubators that can control this aspect.

I can make such a PRQ if you like the idea.


fdfdsfdsfdfd


efsfsdf


sdfsdf


fsdfsdf


fsdfds


', both at collection and analysis time'


I would also call out the hardware timestamps here


Questよいですね！！！そうします！


Mazo "proyetos"


this class is empty


What you are doing with the start and stop is reasonable, but you may want to think about a directive icon that self contains this logic for you. This is why I haven't yet attempted the file upload progress bar directive. When the user starts to upload 7 different printables, the GUI starts to get a bit complicated.

Same goes for concurrent loading of resources from the server. If there are six buttons that are loading resources, you aren't going to want a startLoading/stopLoading variable for each of those different resources.  Great progress by the way. I'll be testing your branch this afternoon and I'll let you know what I think.


requires more explanation to make sense ("Why do you have time *and* timestamps?") which I have room to provide below


DNXCORE compiler directives should eventually be renamed to NETSTANDARD


Fix #7 (wrong title)


in inventory index.php


Did we release anything before v1.0.0?


page code change to UTF-8 and translated


No


@RubenKelevra I actually just included that patch to avoid rebase conflicts ;)


Do we need to point this out then?


MSVC would call the destructor of "defer" immediately after the constructor was called, while it should actually be called at the end of the scope.


@NeoRaider ah! :)


os_2_0_develop_measures (macumber) - x86_64-MacOS-10.10-clang: Build Failed

![Build Badge](http://img.shields.io/badge/build%20status-failing-red.svg) ![Test Badge](http://img.shields.io/badge/tests%20passed-NA-red.svg)


Just to test whether branching occurs well.


savepl.lua


If the Unfettered are using Pond Striders, the description for them should be changed because, at current, they are stated to be the Hai attempting the 'contain the increasingly aggressive Unfettered with their new Solifuge'.


@mo0ojava
Ok, make your pr


```
  /**
   * In cases when stub hierarchy corresponds to AST hierarchy, i.e. both a parent and its child nodes support stubs, {@link #getParent()}
   * can be implemented efficiently without loading AST, using this method instead. It checks if there is a stub present, takes its parent
   * and returns the PSI corresponding to that parent. Please be careful when using this method and use it only in the described case,
   * because if there are AST-only elements in the hierarchy, it'll return different results depending on whether this element is stub-based
   * or has already been switched to PSI.
   *
   * @return a PSI element taken from parent stub (if present) or parent AST node.
   */
  protected final PsiElement getParentByStub() {
    final StubElement<?> stub = getStub();
    if (stub != null) {
      return stub.getParentStub().getPsi();
    }

    return SharedImplUtil.getParent(getNode());
  }
```


Someone said that an app that does not really fit is Abiword, it
messes up some documents.. leafpad and geany are enough.,.. and then
offer to download Libre Office, WPS Office Community (chinese) is
quite smaller.. it's a Microsoft Office 2013 clone and it's pure C++,
but does not support  ODF and it's also closed source.


You've got to be kidding me

```
  /**
   * In cases when stub hierarchy corresponds to AST hierarchy, i.e. both a parent and its child nodes support stubs, {@link #getParent()}
   * can be implemented efficiently without loading AST, using this method instead. It checks if there is a stub present, takes its parent
   * and returns the PSI corresponding to that parent. Please be careful when using this method and use it only in the described case,
   * because if there are AST-only elements in the hierarchy, it'll return different results depending on whether this element is stub-based
   * or has already been switched to PSI.
   *
   * @return a PSI element taken from parent stub (if present) or parent AST node.
   */
  protected final PsiElement getParentByStub() {
    final StubElement<?> stub = getStub();
    if (stub != null) {
      return stub.getParentStub().getPsi();
    }

    return SharedImplUtil.getParent(getNode());
  }
```

```
/**
   * @return parent PSI element taken from the parent of the corresponding AST node. If AST has not been loaded, it is loaded
   * (in {@link #getNode()}), which might take significant time and memory cost. If possible, {@link #getParentByStub()}
   * should be used instead.
   */
  protected final PsiElement getParentByTree() {
    return SharedImplUtil.getParent(getNode());
  }
```


Is it the other way in < `2016.2`?


They eventually will. I considered renaming the directives to DNXDOTNETSTANDARDCOREORSOMETHINGNOONEREALLYKNOWSWHATTOCALLTHISSHITTHESEDAYS. But that would unfortunately violate the maximum line length coding guideline.


Dood, confirm before you push. xD


@DefinitlyEvil lol) You know what problem is in RakNet client?


os_2_0_develop_measures (macumber) - i386-Windows-7-VisualStudio-12: Tests Failed (0 of 0 tests passed, 0 test warnings)

![Build Badge](http://img.shields.io/badge/build%20status-passing-green.svg) ![Test Badge](http://img.shields.io/badge/tests%20passed-NA-red.svg)


^ who gave him access anyway.


It wasn't cleared by me or Def


啊啊啊啊啊，怎么用啊啊


os_2_0_develop_measures (macumber) - Win64-Windows-7-VisualStudio-12: Tests Failed (0 of 0 tests passed, 0 test warnings)

![Build Badge](http://img.shields.io/badge/build%20status-passing-green.svg) ![Test Badge](http://img.shields.io/badge/tests%20passed-NA-red.svg)


patches = paths
english is hard


@TekkitCommando @TheDiamondYT1 gives


os_2_0_develop_measures (macumber) - x86_64-Linux-Ubuntu-14.04-clang-3.5: Build Failed

![Build Badge](http://img.shields.io/badge/build%20status-failing-red.svg) ![Test Badge](http://img.shields.io/badge/tests%20passed-NA-red.svg)


@MrGenga Hmm makes sense.


@stefansaraev You can either use freescale like here: https://github.com/LibreELEC/LibreELEC.tv/pull/665
or bump iScreenWidth/iScreenHeight to match iWidth and iHeight and screen resolution.


That could be it. Note that there is also a lint task in CI `npm run lint` that disallows use of of `==`.


os_2_0_develop_measures (macumber) - x86_64-Linux-Ubuntu-14.04-cppcheck-1.61: Build Failed

![Build Badge](http://img.shields.io/badge/build%20status-failing-red.svg)


Gotcha.  In Lua, you can't have single variable expressions.  __lua_table__ is a magic method that is basically a proxy for an anonymous table expression.

Your fix is fine, I think this is a strange quirk of Lua, and not something that's worth generalizing deeper in the compiler.


My fix is not fine in the general case because there could be some side-effect going on in the call arguments, which should still be generated. I could transform that in the analyzer but I'm reluctant to add target-specific checks like this there.


Will it have Multi Language?


Android异步加载


dynamips_path is special, on all other paths you can use the pure command name and GNS3 looks in the path. It normally looks like this (for all other paths except dynamips):
```
        path = self._manager.config.get_section_config("IOU").get("iouyap_path", "iouyap")
        if path == "iouyap":
            path = shutil.which("iouyap")
```
So if you uncomment the line `;iouyap_path = iouyap` GNS3 will look for iouyap in the PATH.

But the dynamips path code (in gns3server/modules/dynamips/__init__.py) says:
```
        dynamips_path = self.config.get_section_config("Dynamips").get("dynamips_path")
        if not dynamips_path:
            dynamips_path = shutil.which("dynamips")
```
So if you uncomment this `;dynamips_path = dynamips` it will not look for dynamips in the PATH. So as long this line is commented all is fine, but when you uncomment it, you **MUST** give the full path name. Therefore I used a full path in the example. Alternatively the code could be changed that dynamips_path behaves like all other path variables.


Hi @CHERTS,
[esp8266_faq_en.pdf](https://github.com/CHERTS/esp8266-devkit/blob/master/Espressif/docs/ESP8266/esp8266_faq_en.pdf) is really interesting and valuable document.
Thank you for digging it out and posting!
Krzysztof


So at least the browser should be in the adrv.

I guess someone building a pup must be offered the option to choose between possible adrvs, a adrv with (dillo) qtweb, light firefox, palemoon, firefox and chrome.. maybe. or maybe in a possible 00build.conf browser=option

Should i implement this in 3 builddistro? ibiblio must host the files. I guess peebee can donate the sfs's as he already uses something like this.

distro pkgs specs must not contain any browser (except dillo maybe - 500KB)


contrib/codeanalysis/runcppcheck.sh: line 9: ../cppcheck-1.66/cppcheck: No such file or directory


Good catch.

So we should keep `sparkContext`, `sqlContext` and `sparkSession`, right ?


adding temp design


la la la, i am a good man!


Thanks! I :heart: `gzip-size-cli` and `pretty-bytes-cli`. I use them almost every day!


You could speed up your load time more using replacing .social > a with .social__link . I try to shoot for only one class name and not styling directly on elements


Exactly, it does not check whether "parent isn't a stub", which leads to

>if there are AST-only elements in the hierarchy, it'll return different results depending on whether this element is stub-based or has already been switched to PSI

, which was the case with all `RustStubBased` elements until [this commit](https://github.com/intellij-rust/intellij-rust/commit/8f02d6b5ab4756941cfcc636160dd540975eb54e).


Same for the focus being put directly on .social__link:focus


@zturtleman I'm pretty sure I know what this was for.  :trollface:


add on getup


Oh! lol. So right, this is a commit before I added the RUN instruction.


don


Oops, I just didn't remember this test, thanks Alain!
I will stop my version.


If you look on the refactor branch's Dockerfile, you'll see it there. Sorry!


hello...


this is good


@finnq The initial version for only pn547 is correct. The policy for pn544 is defined by default in external/sepolicy.

See https://github.com/CyanogenMod/android_external_sepolicy/blob/cm-13.0/file_contexts#L70


asdadfsd


# asfsdgfsdfgsdfd****


Good job :)


#

> [`****`](

# sadfsgadsfgfsdrg

)


Sorry, the commit message should read:
> opts.parallel flag is **now** properly handled


**# FACE FAG SQUAD**


fdg


dgh


gdfh


ghdgh


dfh


sdfg


database


This is a terrible idea, before it was able to work entirely contained in its own dir, now it needs to put stuff into /var/www/ for some reason? How about some of us don't even use /var/www in the first place, there's an /srv nowadays, you know...


Please Note: I actually haven't created the Colliders for the FerTile and/or Plants....... Only the framework couldn't work it out.


to show Meals Item List and Detail


Following pretty-bytes lead \@sindresorhus 😎


After I make a debug, I find out that there are some mistakes in building table sentences.But there are some
other wrong places.


You can easily activate Travis on your own fork. Please do that instead.

> 27 aug. 2016 kl. 17:18 skrev (λ _ λ) <notifications@github.com>:
>
> i won't keep it, just want to trigger the CI server to rebuild 😅
>
> —
> You are receiving this because you are subscribed to this thread.
> Reply to this email directly, view it on GitHub, or mute the thread.
>


Very dirty way to address douglascalhoun/eval-javascript#1


Why would you use `bash < /setup_6.x` over `bash /setup_6.x`? The first possibly does weird things, depending on the environment but the latter is consistent and explicit in intent.


Looks like the installation doesn't need `root`, therefore the `USER` instruction can be moved previous to the `git clone` and remove the need for this


No.  Other postconf scripts also only append .postconf to the basename, as I try to avoid having double dots (i.e. no file.conf.postconf).  The ".postconf" bit is automatically appended by run_postconf().

You can see by running "grep postconf rc/*" on the code tree.


This requires range check after we know that finger positions are calibrated. Temporarily commented out.


noticed so as well, and the Solifuge isn't "released" yet which is also weird


엇, 이거슨! 0 -> 1로 고치기!?


GREAT! I don't know to say something else, really useful!


hi, you there?


The word 'assumed' has to be included. I vote for "Show assumed-unchanged files".
Thank you @pmme for your help.


Moar, moar, moar, nom nom!


I've created a static method as discussed in IRC, but it doesn't make it accessible from a kinto.js program:
KintoClient is not accessible.

I should have made it at least a method, so I could write
```
var api = tickets.api.bucket(tickets.bucket).collection(tickets.name);
api.client.execute({ path: tickets.api.endpoint("records", tickets.bucket, ticket.name, method:"HEAD"})
```


I appreciate that. I'm going to probably take some heavy inspiration at least, as you're much farther toward ripping out that evented model, and I'm in need of some better query/response handling already with the ping stuff. The "right" answer on how to handle that is basically what you've done.


@VoLuong thanks for inform ; )


Salut,
je viens de tomber par hasard sur ton fork. Toi aussi tu reprends doucement le codage avant la rentrée ?

Je suis content de voir qu’on s’intéresse à un de mes vieux travaux, et un peu surpris aussi de voir que le jeu DoA existe toujours :P Si tu veux des conseils pour reprendre mon script, n’hésite pas à me demander.

Tu n’utilises pas correctement la licence CC, mais c’est déjà bien que tu l’aies laissée. Normalement tu dois citer mon nom. J’ai vu différentes pratiques, certains ajoutent une balise `@author`, ou ajoutent leur nom à la suite dans la même balise `@author`, ou ajoutent une balise `@copyright`, ou encore utilisent `@contributor`. Tu fais comme tu préfères.

Envoie-moi un email si tu veux discuter plus à l’aise ;)


Desenvolvimento de um software para o gerenciamento uma loja de venda de roupas.


of course, best would be to only have to write
```
var api = tickets.api.bucket(tickets.bucket).collection(tickets.name);
api.client.execute({ path: api.endpoint("records"), method:"HEAD"})
```
omitting the bucket and name arguments, but I can't think of a way to do this with the existing   `endpoints.js`


Miért kellett átírni?
Mit csinál ez a sor?


@najidagher  hon el fare2 , yemkin hadak .class


Refactor restrictions


where is bryan
?


Why not always call shutil.which on the config variable?
```
        dynamips_path = self.config.get_section_config("Dynamips").get("dynamips_path", "dynamips")
        dynamips_path = shutil.which(dynamips_path)
```
If it is an absolute path, shutil.which doesn't harm, on the other side this will work also when setting the variable to e.g. "dynamips_new". Then it will use PATH also on non standard command names.


It is time.


That explains the of [brackets? translations? meanings?]


Capitalized ACTIVITY_INSTANCE; that's how it's referred to in the rest of the vignette


syntax error


It begins...


How about this:

New variable(s) in DISTRO_PKGS_SPECS-*

somethimg like
PKGS_SPECS_TABLE_ADRV
PKGS_SPECS_TABLE_YDRV
PKGS_SPECS_TABLE_FDRV

This way the base is in the puppy.sfs, the extensions in the rest of
the sfs files. The extensions can be small or big.

Also, i think there should a special PKGS dir where the script just
extracts stuffs and processes according the packages-templates, this
way a online database is not needed, not even a pkgs specs.. for
people who want to build the easy way with local custom packages..


Learning


( note for myself ) Raise a JIRA for this, it would be great if Axis2/c provide a param through the axis2.xml file


Yes, exactly
I ordered and commanded :D


Thank you!


could you also please update npm?


made


aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa


So what I just explained is another major redesign that interferes with the work of the builders and requires some work to identify what packages are the base, etc.


Working on it right now, I'll keep you posted.


Also added bug fixes and handling of freezer temp/humidity on templates, and changed livability inequality to more accurately reflect New England temp tolerances


I don't think so. If i remember correctly this issue has been introduced by #1284.


I'm not so sure!


I forgot...
#21


Any reason why we have moved from `chzn-done` to `chosen-done` here as a class?


The change LGTM. It is actually a big improvement from the previous version by generating the `Event` straight out of the queue instead of another transformation. Great job!


@max-gram, `0.2.1` is available on NPM now, seems like something went wrong with publishing the first time I tried.


also looks like it fixes #406, since the stack trace lands in the same place


현재 예외에 대해서만 처리를 하는데, 오류에 대한 리포팅 기능이 있어야함.


I can confirm it all works. Thank you for putting this module together!


@mcostalba but null search and friends will behave completely different because depth is halved. The whole idea of IID is to do a reduced depth search to order the tree. Why should we activate skipEarlyPruning and do a different search. Makes really no sense to me.

You should stop the test if I you will not approve the patch if it goes green because otherwise it is just a waste of resources.


test


This method is modified from an example and was for my learning only, it is not used in the app.  I will be changing this method later to make it into a logic check that will make sure that the signed in user can only see his/her own game page.


https://github.com/gsd101/realtime-chat-application/wiki/steps-to-run-java-project.
Let me know what you think of this.

Regards,
Rakesh Singh Thakur

On Fri, Aug 26, 2016 at 10:37 PM, Andrew Meiling <notifications@github.com>
wrote:

> Dude you should add some steps for me to get this up and running on my
> system
>
> —
> You are receiving this because you are subscribed to this thread.
> Reply to this email directly, view it on GitHub
> <https://github.com/gsd101/realtime-chat-application/commit/e7aa2ec0c4463b25f8bfaecbbd8ba181cdf8cd35#commitcomment-18801596>,
> or mute the thread
> <https://github.com/notifications/unsubscribe-auth/AIQomQNfjTOp-WRwYKtgVXnGZSRGzBBOks5qj80RgaJpZM4JunzM>
> .
>


Plugins...


Testando o Transceiver


I dont remember giving


Such an extensive job and still misses line 36...


This seems to improve endgame strength according to my tests.  It may do more, but I was only looking at endings.  Looking forward to the test against the master.


@SharkHunter Thanks :+1:
Please, have a look at https://github.com/UniversalMediaServer/UniversalMediaServer/commit/3aa63893e4d53099bad8d53472aaf79be913f8ba and tell me if i writen something incorrect.

The _live_subtitles_limit_ is set for one movie, right ?


@fichtner Hier muss ich nachbessern.


@mastercoms Sorry to bother you, but fould you maybe fix the maven modules because it doesnt build and evem when it does only in the proxy submodule


nope, pattern matching is cheap.

```
$ cat ./Driver.scala
object Driver {
  def foo(bar: Option[String]): String = bar match {
    case Some(baz) => baz
    case None => "default"
  }
}
$ scalac -print ./Driver.scala
[[syntax trees at end of                   cleanup]] // Driver.scala
package <empty> {
  object Driver extends Object {
    def foo(bar: Option): String = {
      case <synthetic> val x1: Option = bar;
      case6(){
        if (x1.$isInstanceOf[Some]())
          {
            <synthetic> val x2: Some = (x1.$asInstanceOf[Some](): Some);
            {
              val baz: String = x2.x().$asInstanceOf[String]();
              matchEnd5(baz)
            }
          }
        else
          case7()
      };
      case7(){
        if (scala.None.==(x1))
          matchEnd5("default")
        else
          case8()
      };
      case8(){
        matchEnd5(throw new MatchError(x1))
      };
      matchEnd5(x: String){
        x
      }
    };
    def <init>(): Driver.type = {
      Driver.super.<init>();
      ()
    }
  }
}
```

Look ma, no allocations!  In comparison, getOrElse takes a call-by-name parameter, which entails an allocation to convert the call-by-name to a `Function0` under the hood.


Thank you so much.


Line on Github


Also added a new moment activity and a layout, still WIP.


github


@pascalfares the problem of this task
1- http://stackoverflow.com/questions/39111408/make-content-of-horizontalgroup-wrap-to-the-next-line-in-libgdx
2- http://stackoverflow.com/questions/22437097/android-studio-0-5-2-gradle-refresh-project-failed
3- choose a good font


bugfix


Class ResetPassword is missing a docblock.


$router->get('logout', 'Auth\LoginController@logout')->name('auth.logout'); //FIXME:MIDDLEWARE AUTH convert to post


looks like a big mistake to me


Later, I don't have time at the moment.


@valib I did contacted his daddy but i was not sure to get answer; i was wrong, this child is not an orphan :smile:
https://github.com/UniversalMediaServer/UniversalMediaServer/commit/3aa63893e4d53099bad8d53472aaf79be913f8ba


@romanrm having the public directory next to the private account key didn't seem like a good idea to me, especially if you think about having no more work because it can just be the web root or something. all examples are using /var/www/letsencrypt so it seemed like a reasonable idea to set this as default path. if you require a different path just use the config file, that's what it's for.


已经部署过该项目的要执行`yii migrate/down 4`再执行`yii migrate`来更新后台菜单，然后清空`/web/assets`内的临时文件即可。


Próba huba


@eirannejad
At first I was confused. Then I figured out, but I thought liked the way I had it organized on my branch. :smile:
But I am by no means attached to it, so I just need to reorganize the branch.
Cheeers


REALLY. +_+


I think this commit breaks the build.
For example:
Collected errors:
 * satisfy_dependencies_for: Cannot satisfy the following dependencies for openhdf-base:
 * 	enigma2-plugin-drivers-network-usb-rtl8188eu *
 * opkg_install: Cannot install package openhdf-base.

And you mean, the change from PR = "r1" to PR = "r0" is the correct way?


i really worked hard on this commit guys!


The reason I didn't include DVB-C2 in first place was because currently linux still doesn't know about C2.

[linux kernel v4.8-rc3](https://git.kernel.org/cgit/linux/kernel/git/torvalds/linux.git/tree/include/uapi/linux/dvb/frontend.h?id=refs/tags/v4.8-rc3)

```c++
enum fe_delivery_system {
	SYS_UNDEFINED,
	SYS_DVBC_ANNEX_A,
	SYS_DVBC_ANNEX_B,
	SYS_DVBT,
	SYS_DSS,
	SYS_DVBS,
	SYS_DVBS2,
	SYS_DVBH,
	SYS_ISDBT,
	SYS_ISDBS,
	SYS_ISDBC,
	SYS_ATSC,
	SYS_ATSCMH,
	SYS_DTMB,
	SYS_CMMB,
	SYS_DAB,
	SYS_DVBT2,
	SYS_TURBO,
	SYS_DVBC_ANNEX_C,
};
```

Also QAM 1024 and 4096 are missing.

```c++
enum fe_modulation {
	QPSK,
	QAM_16,
	QAM_32,
	QAM_64,
	QAM_128,
	QAM_256,
	QAM_AUTO,
	VSB_8,
	VSB_16,
	PSK_8,
	APSK_16,
	APSK_32,
	DQPSK,
	QAM_4_NR,
};
```

So even if the device is DVB-C2 capable, linux is not yet.


Galeri foto google


Aktif


Yeah good point.


root@gbquadplus:~# dvb-fe-tool -f 3
Device GIGA DVB-C/T2 NIM (SI4768) (/dev/dvb/adapter0/frontend3) capabilities:
     CAN_2G_MODULATION
     CAN_BANDWIDTH_AUTO
     CAN_FEC_1_2
     CAN_FEC_2_3
     CAN_FEC_3_4
     CAN_FEC_5_6
     CAN_FEC_7_8
     CAN_FEC_AUTO
     CAN_GUARD_INTERVAL_AUTO
     CAN_HIERARCHY_AUTO
     CAN_INVERSION_AUTO
     CAN_QAM_16
     CAN_QAM_32
     CAN_QAM_64
     CAN_QAM_128
     CAN_QAM_256
     CAN_QAM_AUTO
     CAN_QPSK
     CAN_RECOVER
     CAN_TRANSMISSION_MODE_AUTO
DVB API Version 5.10, Current v5 delivery system: DVBT
Supported delivery systems:
     DVBC/ANNEX_A
    [DVBT]
     DVBT2

It is not capable C2 - it just lists it wrongly.


You mean 0, right?


All gui apps should be in the adrv, the only exception is those that are there to configure and maintain puppy, e.g. sfs_load.
Puppy is not supposed to be useful without an adrv, there would always be an adrv in the iso, the puppy creator would decide how skinny or fat that adrv was.
I don't consider that woof is a user level app, but I can conceive of a user level app that has only a single purpose, to produce an adrv. A puppy creator might as well use the same app to produce the default adrv, (and any non-standard ones if they so choose). Woof would ask the puppy creator which adrv to include in the iso.
Yes this is not a simple thing, but a start can be made by finding a way to create puppies that put at least the bulk of user apps in an adrv, instead of puppy...sfs. The highest priority is all the apps that folk argue over as to which particular app should be included, and of course the large apps.


Only i


Only issue is that the directory should be all uppercase  WIKI


Yeah don't worry about the branch. I copied the package manager under my repo and installed pyRevitPlus and everything went perfectly fine. Package manager works perfectly. Let me know when it's resdy for beta testing and we can publish a v3-beta to the pyRevit repo and get everyone started on testing.

I'm excited obviously! 😂😂

Sent from my cell phone
Please excuse the typos

> On Aug 27, 2016, at 11:16, Gui Talarico <notifications@github.com> wrote:
>
> @eirannejad
> At first I was confused. Then I figured out, but I thought liked the way I had it organized on my branch. 😄
> But I am by no means attached to it, so I just need to reorganize the branch.
> Cheeers
>
> —
> You are receiving this because you were mentioned.
> Reply to this email directly, view it on GitHub, or mute the thread.
>


>It is not capable C2 - it just lists it wrongly.

But even if there was C2, there is no way to get it using current linux!

I guess something like SYS_DVBC2_ANNEX_A required and C2 QAM modulations.


@robske110 Vanilla


Any reason we're no longer setting the instance id? It's part of the container MonitoredResource schema...


Oh, never mind, it's factored out below...


$$$<Steven


problems?


I forgot that reference #21


@1337 LOL I accidentally tagged you, but thanks for catcing that!!! :sweat_smile:


``<h3> welp </h3>


Steven Alvarez$€¢


No, I just wanted stock Kernel Adiutor to be able to control touch boost


Instead of hard-coding these requirements, I suspect a better long-term approach would be to retrieve the MonitoredResourceDescriptors and examine them... But for the initial prototype I'd just suggest adding a TODO.


\*paid :p


aah, ok @xX-Yoshi-Xx atm i use the kernel adiutor mod xD


+$$$for Steven Alvarez sr


@tkovs, não entendi :thought_balloon:


Well up until now it was perfectly usable without ever needing a config file.
How does it matter where the public directory is, when you make an alias at the web server directly to /path/to/basedir/.acme-challenges/ and not to the basedir itself anyways.
And private or public, it all needs to be readable by the web server user (www-data) for the server to be able to read certs in any case.


@gumingpo
Just merged latest master into mindskin, pls update. Note the android/AndroidManifest.xml
may have conflict and check it out.

However i forgot to update mavlink submodule again.

@eflyinghi can you help to fix it?


+$€¢ sun star Steven Thomas Alvarez sr


Só para conhecimento, no padrão do C99 eu posso omitir o `return 0` no final da função, deve haver um paralelo nesse aspecto com o padrão do C++.


All data +time =Steven Alvarez sr


Do we still need `-lm`? I guessed it was needed for `div()`


Nit: you have trailing periods in other such comments...


Oh, sorry. My fault. But actually we should avoid using pthreads at all.
C11 introduced a new header for cross platform thread support.


@cloudmaniac Good catch! I will correct that once I get the time for testing a full deploy
I opened issue #27 to track this.

Thanks!


Finally I created a Color::GammaValues struct. An array passed as parameter doesn't check for allocated memory.


Nit: "Move GKE container labels from..."


@etegan: testar vi vår @ annotation med dethär testverktyget?


After relaxing a little; the idea is to see puppy...sfs as the base and the adrv as the optional apps.


@etegan: Varför ett subprojekt?


Yup, it depends what is in the Spark code. Nevertheless, i already integrated this patch into working rel-2.0 branch with SparkSession.

However, it is still open question which we need to verify.
And of course brings some support for SparkSession


hey mate.sorry bugging you again...

here is the kmsg log

init: Warning!  Service emmc_trim needs a SELinux domain defined; please fix!
init: cannot execve('/system/bin/emmc_trim'): No such file or directory
init: Warning!  Service logd needs a SELinux domain defined; please fix!
init: property_set("ro.product.name", "cm_jflte") failed
init: Warning!  Service vold needs a SELinux domain defined; please fix!
init: avc:  denied  { set } for property=vold.has_adoptable scontext=u:r:kernel:s0 tcontext=u:object_r:vold_prop:s0 tclass=property_service
init: Warning!  Service exec 0 (/system/bin/tzdatacheck) needs a SELinux domain defined; please fix!
init: property_set("ro.nfc.port", "I2C") failed
init: Warning!  Service sysinit needs a SELinux domain defined; please fix!
init: Found bootloader id I9505XXUHPF3 setting build properties for jfltexx device
init: Warning!  Service logd-reinit needs a SELinux domain defined; please fix!
init: Warning!  Service lmkd needs a SELinux domain defined; please fix!
init: Warning!  Service servicemanager needs a SELinux domain defined; please fix!
init: Warning!  Service surfaceflinger needs a SELinux domain defined; please fix!
init: Warning!  Service config_bluetooth needs a SELinux domain defined; please fix!
init: Warning!  Service qcamerasvr needs a SELinux domain defined; please fix!
init: Warning!  Service bsod_killer needs a SELinux domain defined; please fix!
init: property_set("ro.bt.bdaddr_path", "/efs/bluetooth/bt_addr") failed
init: SELinux: Could not get canonical path /sys/block/sda/queue/scheduler restorecon: No such file or directory.
init: SELinux: Could not get canonical path /sys/block/sde/queue/scheduler restorecon: No such file or directory.
init: SELinux: Could not get canonical path /sys/block/dm-0/queue/scheduler restorecon: No such file or directory.
init: Warning!  Service ledify needs a SELinux domain defined; please fix!
init: cannot find '/system/bin/rmt_storage', disabling 'rmt_storage'
init: Warning!  Service kickstart needs a SELinux domain defined; please fix!
init: Warning!  Service netd needs a SELinux domain defined; please fix!
init: Warning!  Service debuggerd needs a SELinux domain defined; please fix!
init: cannot find '/system/bin/debuggerd64', disabling 'debuggerd64'
init: Warning!  Service ril-daemon needs a SELinux domain defined; please fix!
init: Warning!  Service drm needs a SELinux domain defined; please fix!
init: Warning!  Service media needs a SELinux domain defined; please fix!
init: Warning!  Service installd needs a SELinux domain defined; please fix!
init: Warning!  Service keystore needs a SELinux domain defined; please fix!
init: Warning!  Service irsc_util needs a SELinux domain defined; please fix!
init: Warning!  Service qmuxd needs a SELinux domain defined; please fix!
init: Warning!  Service netmgrd needs a SELinux domain defined; please fix!
init: Warning!  Service macloader needs a SELinux domain defined; please fix!
init: Warning!  Service zygote needs a SELinux domain defined; please fix!
init: Warning!  Service gatekeeperd needs a SELinux domain defined; please fix!
init: Warning!  Service perfprofd needs a SELinux domain defined; please fix!
init: Warning!  Service loc_launcher needs a SELinux domain defined; please fix!
init: Warning!  Service qseecomd needs a SELinux domain defined; please fix!
init: Warning!  Service time_daemon needs a SELinux domain defined; please fix!

any ideas :/ ?


FYI you can send in module name here, doesn't have to be String:

Exq.enqueue(Exq, "demonoid", Magnetissimo.DownloadWorker, [url, "demonoid", "root_url"])


Well, all apps are defined in PKGS_SPECS_TABLE='', this means it should be split into at least 3 categories (or variables maybe):

- base (all the important and system apps)
- adrv (gui apps - the default bulk)
- devx (development stuff)

To build a simple test iso, the devx is not needed, but its packages are processed anyway, it has a lot of heavy stuff


@ConradBunton Post the error. Everything is fine and the error is just on your end until otherwise proven: https://gist.github.com/Rochet2/4da449b6131a64a2841b26523ed0b103


@Test processorn måste kompileras innan den kan användas av huvudprojektet. Därför måste den vara subproject så man kan sätta att huvudprogrammet har processorn som dependency :)


Checking parameters. This will be removed from production environment.


Chevere, funciona todo bien.


Aha! Så build scriptet bygger subprojektet först för att kunna hantera våra @ annotationer?


Thank you so much for this clarification @dongluochen - it helped a ton.


Looks like this commit made a test fail in BenchmarkCoreObject


Så subprojektet identifierar @annotationer och tillgängliggör dom för vårt testframework?


Can't check, but this might now fit on one line...


with openNFR build same problem!


Thanks for the lint command, I was searching how to run it for my fitire PRs

Anyway, I'll submit a pr to restore and fix these tests tomorrow !


It contains a list of model indices, one model index per line, for the Pac-Man power pills to spawn on. Vice City does not use treadables so a list has to be created.


Ungefär :) vid compile-time så körs processorn och spottar ut en .java-fil som vi kan säga åt byghscriptet att använda vid test-tasket. Processorn hittar alla annotationer med @Test och så läggs dom till i den genererade källkoden.


block is basically the unit in which a data could be stored
hence block size is defined as the size of the block in  which data is stored
for windows os 4kb is the smallest size, where as it does not have any max limit for the block size

block size of the computer can be defined as the block or the segmentation of the main memory we do, the division of the total memory is the block size


Yes, that looks like a good start.
Actually the rationale for an app being in the adrv, is if there's a reasonable chance some users would want to omit it. Some are obvious because there are alternative apps. But also if apps are sizable, users might want to omit them if they consider them a waste of space.
But all of this doesn't mean much until we have a mechanism to do it.


Can you send me a list of the plugins or narrow it down to one that does it?   I know it's not the plugin itself that's the issue but I need a good test example to work on pthreads


Quick check here @adiraomj. Thanks :)


I did some refactoring in the grpc branch that may also be useful here (e.g., set_severity -> compute_severity). Mind taking a look at those changes and letting me know which ones we should pull into the master and apply here?


Good...!!! :+1:


I think just changing the directory name and the name in INSTALLED_APPS in the settings file might work

The url is independent of the actual app name so that could be changed to lowercase too


@marcoemrich Two things:
1. The file needs to be moved to `participants` folder
2. Only 3 tags are allowed, otherwise the build will fail


That's awesome, I'll tweak that since it's better to not use magic strings.


Nit: unmatched parenthesis...


Fixes #2


# Accidentally added other user's files.


Rekt reads the data files like us, he has seen the event in Wanderers.txt.


ok, och sen är det på den filen som vår test-funktionalitet körs? Hur kommer Google-compile-testing in i bilden? Jag fattar det som att det är ett sätt att testa pre-processorer?


처음 채팅방이 만들어지면, Channels 에 데이터가 생성되고, Chats 에는 Channel 을 만든사람 것만 생성된다.

이유는, 난 만들었지만 아직 메시지를 보내지 않았기 때문에 상대방과는 연결을 하지 않는다는 것!!

그래서 Channel 을 만든 사람이 맨 처음 메시지를 날리면,
바로 그 때!! Channel 안에 있는 Users 들의 Chats 데이터를 생성해야 한다. !!!

지금 작업중인 내용이 바로 이것 !


This resource_name is a bug, but you've already fixed it in a subsequent commit...


ID3 algorithm, Entropy https://www.udacity.com/course/viewer#!/c-ud129/l-313488098/m-313175589


Sorry to spoil the mood, I'm as hyped as anyone for this, but, in Wanderers Rescue 1, it doesn't make sense that 2 Tempests can evacuate almost a hundred Wanderers when they only have 53 bunks and require 40 crew and so can only carry 26 passengers between them.


I liked your comment the other day about adding a func on the component that allows us to store the file path for later conditional work (as we can't go from filepath to resolved component from what I've seen thus far)

The HotReloadComponent could allow us to "set" that filepath during resolver time -or no?


Compile-testing verkar vara ett ramverk för att testa processorn ja :) Hade tänkt att filen som processorn genererar har en funktion som returnerar alla funktioner


Why is this not necessary in the `search()` method in this class?


Är det så jUnit har implementerat @ test
(man får passa sig med @ i comments, annars börjar man pinga alla möjliga github användare)


Nått i den stilen i alla fall :)


why not creating another app called `privatebin_ynh` ?


update


For issue #5


Sorry for not replying to this one. I got confused by GitHub's commit display order. Let's keep the commits on this branch separate, to easily follow the review history, and squash them upon merging into master.


closes #100


@spudowiar Fixed the issues you raised, in both this commit, and the previous one.


+pref("app.update.url.manual", "https://www.rotorbrowser.com/update.html");


Should we put our website on Github as well?  There's a lot of updates to be made there..


The icons have been compared to the original with imagemagick `compare`
like this:

```sh
#! /bin/bash

ORIG_DIR="original/gtk-3.18/"
MOD_DIR="modified/gtk-3.18/"
COMP_DIR="compare/gtk-3.18/"
INDEX="assets-3.18.txt"
RESULT="results-3.18.txt"

rm $RESULT
for i in `cat "$INDEX"`
do
    w=`identify -format %w $ORIG_DIR$i@2.png`
    h=`identify -format %h $ORIG_DIR$i@2.png`
    n=`compare $ORIG_DIR$i@2.png $MOD_DIR$i@2.png -metric AE -fuzz 3600 \
    $COMP_DIR$i@2.png 2>&1`
    p=`expr  $n \* 100 / $w / $h`
    if (( $p > 3 )); then
      echo $i $n \($p\%\) >> $RESULT
    fi
done
exit 0
```

This gave the following output:

```
checkbox-checked 69 (6%)
checkbox-checked-insensitive 49 (4%)
radio-unchecked 56 (5%)
checkbox-checked-selected 69 (6%)
checkbox-checked-insensitive-selected 49 (4%)
switch-header 2628 (52%)
titlebutton-close-active 46 (4%)
checkbox-checked-dark 66 (6%)
checkbox-checked-insensitive-dark 45 (4%)
radio-unchecked-dark 56 (5%)
radio-unchecked-insensitive-dark 83 (8%)
```

**Notes:**

Most differences stem from very slight changes on a sub-pixel scale. Nevertheless,
they show up as color differences in antialiasing results.

1. The switch checkmark has been redrawn and slightly repositioned. The visual
   difference should be almost invisible. On the plus side, all checkmarks
   are now produced from the same path data.
2. Not all corner roundings for the checkboxes were identical, so some corrections
   show up. The effect of redrawing the checkmark is minimal.
3. The borders of the radio buttons were not drawn as circles, but as squares with
   rounded corners. This has been exchanged.
4. `switch-header` is the only switch icon with a slight transparency. (opacity: 0.9)
   I handled this as an error. If it was intentional, it can be easily changed
   back.


Yeah, but I'm lazy and that functionality wasn't working consistently.


Oki, I'll probably write new PR with support for spark session.

Thanks for pointing it out!

On Aug 27, 2016 8:57 PM, "Michal Malohlava" <notifications@github.com>
wrote:

> Yup, it depends what is in the Spark code. Nevertheless, i already
> integrated this patch into working rel-2.0 branch with SparkSession.
>
> However, it is still open question which we need to verify.
> And of course brings some support for SparkSession
>
> —
> You are receiving this because you authored the thread.
> Reply to this email directly, view it on GitHub
> <https://github.com/h2oai/sparkling-water/commit/59ce26e89d9f195f3f0fac742a0ab9ac609d02d0#commitcomment-18803506>,
> or mute the thread
> <https://github.com/notifications/unsubscribe-auth/AELAS20IQCja1PybryPDlFF3y7iJb804ks5qkIihgaJpZM4Juh7M>
> .
>


I have the same issue as @gperdomor
I'm following the https://github.com/gaearon/redux-devtools/blob/master/examples/todomvc


Change and add the sleep times appropriately.


Yep.


Should we add a Makefile Alex, or should I add it to LinuxFiles?


Can you explain why you did not go with the suggestion from #1001?


WS


No syntax errors here.  Looked and missed 'uprovider_id' twice and couldn't find it's assignment/declaration, but it must be the paint fumes.  All looks good, but I ain't got to test it yet!


Magic numbers (thx to robinsch :D )


我不怕苦。我做的课题之前没有师兄师姐做过，一切都是从头开始，虽然有好几次想放弃，但是最后还是坚持下来了。既然做一件事情，就一定要把它做好。


Could you also provide the script for training, similar to examples/ssd_pascal.py?


@lasalvavida Thanks for fast previous answer!

I use such file for test
```
newmtl default
  Ns 10.0000
  Ni 1.5000
  Tr 0  illum 2
  Ka 1 1 1
  Kd 1 1 1
  Ks 0.2 0.2 0.2
  Ke 0 0 0
  map_Kd default.png
```
I have error on `  Tr 0  illum 2`. I copy your realization. I cut it as `0  illum 2`. And of course I will have a error if I try to parse it in typed language.
The javascript's `parse` function split the string implicitly and parse first item successfully.
```
parseFloat("0  illum 2")
> 0
parseFloat("120  illum 2")
> 120
```
**My questions are**

1. Is it ignored specially? I mean maybe it don't change significantly state and it was simplified.

2. I red the **[specification](http://paulbourke.net/dataformats/mtl/)** briefly. I noticed that this realization very simple. There are a lot of subtle place like the first question. Does it cover 99.99% of cases or how?

**Thanks!**


cc @edolstra


```c++
enum e_party_invite_ack {
	PARTY_INVITE_ACK_JOINED_OTHER_PARTY = 0,  ///< result=0 : "The Character already joined another party." -> MsgStringTable[80]
	PARTY_INVITE_ACK_REJECTED,				  ///< result=1 : "Request for party rejected." -> MsgStringTable[81]
	PARTY_INVITE_ACK_ACCEPTED,				  ///< result=2 : "Request for party accepted." -> MsgStringTable[82]
	PARTY_INVITE_ACK_FULL,					  ///< result=3 : "Party Capacity exceeded." -> MsgStringTable[83]
	PARTY_INVITE_ACK_DUAL,					  ///< result=4 : "Character in the same account already joined." -> MsgStringTable[608]
	PARTY_INVITE_ACK_JOINMSG_REFUSE,		  ///< result=5 : !TODO "The character blocked the party invitation." -> MsgStringTable[1324] (since 20070904)
	PARTY_INVITE_ACK_UNKNOWN_ERROR,			  ///< result=6 : ??
	PARTY_INVITE_ACK_PLAYER_OFFLINE,		  ///< result=7 : "The Character is not currently online or does not exist." -> MsgStringTable[71] (since 20070904)
	PARTY_INVITE_ACK_INVALID_MAPPROPERTY,	  ///< result=8 : !TODO "Unable to organize a party in this map" -> MsgStringTable[1388] (since 20080527)
	PARTY_INVITE_ACK_INVALID_MAPPROPERTY_ME,  ///< return=9 : !TODO "Cannot join a party in this map" -> MsgStringTable[1871] (since 20110205)
};
```


@SharkHunter Cool :-)
I would like documented it, but i need to be sure to fully understand, so your help is welcome.

Do that mean that _LiveSubtitlesTimeout_ is a number of day value (that is converted in milliseconds) ? with a default value of 0 ? and only active when _LiveSubtitlesKeep_ is false.

Every explanations about Live subtitles is welcome though ;-)


Compile:
g++ -o hw2 hw2.cpp


This is my comment.


Sorry, but merge was too soon. I've noticed a regression - VBoxHeadless runs in foreground, and VBoxManage - in background. I'll try to move it to background in next few days, but if I fail this should be reverted.


It's beautiful. I love it, the idea, the look. Great. ****falls in dream****


good commit


well done


Looks like bug5751.src is actually bug5752.src


Why there not zipped anymore?


nice


@elgrillo83 can you take a look into this?
I was cleaning up and tried something out.
What do you think about templates like this? Would you except it in production?
I think I like it, because the template will automatically change if the active record model changes the database fields.

PS. this was just a test


test


wow


what do you mean?


The icons are not in an zip package, look here. https://github.com/robertohuertasm/vscode-icons/tree/master/icons

Or did you miss an update for .gitignore?


@SubJunk I'm searching good will people for explain "Live subtitles" ;-)

I would like documented it, because many issue on the forum and 2 on Github are related to that; i never used that before and didn't any documentation on this subject.
By default, it can download 20 subtitles and they are not kept, right ?

I just tested it, and many things look strange to me, so before test it again i would like know if i used it correctly.

I ask to you because you did many commits on that; i could certainly ask for help to an other busy bee as well but i don't think he like explain too much, right @valib ? ;-)
Hoping not bothering you.


@KsyMC the whole commit is full of conflicts... lol


So this flag can speed up the build process?


Ah, no. I've removed the gitignore line so icons folders is viewable. Some guy made a very cool table with all the icons that the extension is currently supporting and I thought that maybe this way it was easier for him to keep it up to date and maybe later automate the process and publish ourselves something similiar with every build.
We'll see how it all ends with the final integration with the new API.


another comment


```googleusercontent.com/-*/*/*/s0/*.jpg
||www.fshare.vn/*.png```
2 quy tắc này mình nghĩ sẽ ảnh hưởng tới nhiều trang web khác và không nên sử dụng đâu


rwarrwar


@webhaikal  i'm not saw how long it took to compile
but this article can help http://clang.llvm.org/comparison.html#gcc
also clang will be enabled by default at "N"


How can we fix the disappearing/clipping stars?


Good reason, nice that you support other's great ideas. Could you share the link, please. I want to support him, too.

I'm so excited and happy(or proud?) about this project. You already reached 143k downloads. That's a huge number. The code-team wants to give you api access. wow. Keep on.


Dear User,

This project is used primarily for learning purposes, especially in Java 8 and its new lambda expressions, which I feel differentiates good and excellent programs in terms of use. So please feel free to add to my project and help the world understand its benefits, including myself, one line of code at a time. I will continue to append to the list of programs already added. Thanks ;)

Sincerely,

Pranik Chainani


tx and rx are commonly used, i think it's fine.


anoither


why do we put this in `lists.arr` though?


wow!


[This is great work](https://github.com/olzaragoza/vscode-icons/blob/show-supported-icons/icons.md) done by @olzaragoza

@jens1o haven't you seen [this](https://github.com/Microsoft/vscode/issues/10804)? The code team has already implemented the api and it's already available using the insiders version. I think they still don't offer support for tabs and editors section but folders and associations are supported.


Is `~` a typo?


Closes #14

Modified service start to call start code in a new thread. Seems to have fixed the service start slowness problem.


Bạn update lại những mục mình nói là không nên dùng và tạo pull request cho mình nhé!


I only use the normal version. This is great! @robertohuertasm I'll definitly take a look. Wow. I don't know to say, it is just nice.


Cali<p€$¢>control


I think the same flags should apply to binary-dist, app, win-extras etc or it may rebuild


This should fix #2, where the node would not show up under normal circumstances


failed travis?


What even are these `_`s? I guess they're `nil`, but you really should put `nil` instead of relying on the global variable `_` to not be set.


WOOOP!


nice


dddd


5039_stratified_tank_speedup (nmerket) - Win64-Windows-7-VisualStudio-12: OK (2329 of 2332 tests passed, 7 test warnings)

 * 4 tests had: EIO diffs.
 * 2 tests had: ESO big diffs.
 * 2 tests had: MTR small diffs.
 * 1 test had: Table small diffs.
 * 7 tests had: ESO small diffs.

![Build Badge](http://img.shields.io/badge/build%20status-passing-green.svg) ![Test Badge](http://img.shields.io/badge/tests%20passed-99.87%25-yellow.svg)


Maybe we should consider adding in a user definable global property for a density threshold?


#include<stdio.h>

///////////////////////////////////////////////////////////
// Codigo desenvolvido por HDFMF////
////////////////////////////////////////////////////////

//Essa funçao verifica se tudo e 1 ou 0.
void verifica1ou0(int m[][4],int t){
	int i,j,cont=0,cont2=0;
	for(i=0;i<t;i++){
	for(j=0;j<4;j++){
	if(m[i][j]==1){
	cont+=1;
	}
	if(m[i][j]==0){
	cont2+=1;
	}}}
	if(cont==4*t){
	printf("\nResultado --> 1.\n");
	}else if(cont2==4*t){
	printf("\nResultado --> 0.\n");
	}}

//Essa funcao verifica se exite so um octeto no mapa.
void verificaoctetos(int m[][4],int t){

	//----------------------------------- INICIO COMPARACOES OCTETOS -------------------------------------------//

	//Essafuncao verifica se exite so um octeto entre a coluna 0 e 3.
	int i,j,aux=0,aux2=0,cond=0;

	//verifica se tem 1 na coluna 1e2.
	for(i=0;i<4;i++){
	for(j=1;j<3;j++){
	if(m[i][j]>0){
	aux+=1;
	i=4;
	j=3;
	}}}
	//se aux = 1 ai nao entra no proximo if.
	if(aux==0){
	for(i=0;i<4;i++){
	for(j=0;j<4;){
	if(m[i][j]==1){
	aux2+=1;
	}
	j+=3;
	}}}
	if(aux2==8){
	printf("\nResultado--> D`.\n");

	}

//-----------------------------------------------------------------------------////

	//Essa funcao verifica se exite so um octeto entre a coluna 1 e 2.
	i=0,j=0,aux=0,aux2=0;
	//verifica se tem 0 na coluna 1 e 2. se tiver aux=1 i=4 j=3 finaliza o lupi.
	for(i=0;i<4;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==0){
	aux+=1;
	i=4;
	j=3;
	}}}
	//verifica a coluna 0 e 3
	if(aux==0){
	for(i=0;i<4;i++){
	for(j=0;j<4;j+=3){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}else if(m[i][j]==0){
	aux2+=1;
	}}}}
	if(aux2==8){
	printf("\nRespota--> D.\n");

	}

//-----------------------------------------------------------------------------////

	//Essa funcao verifica se exite so um octeto entre a coluna 0 e 1.
	i=0,j=0,aux=0,aux2=0;
	//verifica a coluna 2 e 3 se tem so zero
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}}}
	//verifica a coluna 0 e 1, se tiver 8 uns entao da resposta.
	if(aux==0){
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	printf("Resultado--> C`");

	}}

//----------------------------------------------------------------------------------------///

	//Essa funcao verifica se exite so um octeto entre a coluna 2 e 3.
	i=0,j=0,aux=0,aux2=0;
	//verifica a coluna 0 e 1
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}}}
	//verifica a coluna 2 e 3
	if(aux==0){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	printf("Resultado--> C");

	}}

//----------------------------------------------------------------------------//

	//Essa funcao verifica se exite so um octeto entre a linha 0 e 3.
	i=0,j=0,aux=0,aux2=0;
	//verifica se tem 1 ou so 0 na linha 1 e 2
	for(i=1;i<3;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}}}
	//verifica a linha 0 e 3
	if(aux==0){
	for(i=0;i<t;){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}
	i+=3;
	}
	if(aux2==8){
	printf("Resultado--> B`");

	}}

//---------------------------------------------------------------------------------------//

	//Essa funcao verifica se exite so um octeto entre a linha 1 e 2.
	i=0,j=0,aux=0,aux2=0;
	//verifica se so tem 0 na linha 0 e 3
	for(i=0;i<t;){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}}
	i+=3;
	}
	//verifica se so tem 1 na linha 1 e 2
	if(aux==0){
	for(i=1;i<3;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}
	}
	if(aux2==8){
	printf("Resultado--> B");

	}}

//----------------------------------------------------------------------------//

	//Essa funcao verifica se exite so um octeto entre a linha 0 e 1.
	i=0,j=0,aux=0,aux2=0;
	//verifica se so tem 0 na linha 2 e 3
	for(i=2;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}}
	}
	//verifica se so tem 1 na linha 0 e 1
	if(aux==0){
	for(i=0;i<2;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}
	}
	if(aux2==8){
	printf("Resultado--> A`");

	}}

//-----------------------------------------------------------------------------//

	//Essa funcao verifica se exite so um octeto entre a linha 2 e 3.
	i=0,j=0,aux=0,aux2=0;
	//verifica se so tem 0 na linha 0 e 1
	for(i=0;i<2;i++){
	for(j=0;j<4;j++){
	if(m[i][j]==1){
	aux+=1;
	i=4;
	j=4;
	}}
	}
	//verifica se so tem 1 na linha 2 e 3
	if(aux==0){
	for(i=2;i<4;i++){
	for(j=0;j<4;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}
	}
	if(aux2==8){
	printf("\nResultado--> A\n");

	}}

	//----------------------------------------------------------------//
	//-------------------------incio entre 2 octetos no mesmo mapa----------------------------

	//verifica se tem 1 octeto nas linha 0e1
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<2;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 8 uns na linha 0 e 1 ai entra no if
	//esse if e para verificar se tem 1 octeto na coluna 2 e 3
	if(aux==8){
	for(i=0;i<t;i++){
	for(j=2;j<4;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
 	//se tiver 8 uns na coluna 2 e 3 ai entrA no if
	 //O IF VERIFICA SE SO TEM 1 NAS LINHAS 2 E 3 NAS COLUNAS 0 E 1 ...............
	if(aux2==8){
	for(i=2;i<4;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	//se nao tiver nenhum 1 NAS LINHAS 2 E 3 NAS COLUNAS 0 E 1 entao imprimi o resultado.
	if(aux2==8){
	printf("Resultado--> A` + C.\n");

	}}

//----------------------------------------verifica se tem 1 octeto nas linhas 2 e 3 e 1 octeto nas colunas 2 e 3

	aux2=0,aux=0,i=0,j=0;
	//verifica se tem um octeto nas linhas 2 e 3
	for(i=2;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 8 uns na linha 2 e 3,
	// entao verifica se tem um octeto nas colunas 2 e 3
	if(aux==8){
	for(i=0;i<4;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	//se tiver 8 uns na coluna 2 e 3
	//entao verifica se tem algum 1 nas linhas 0e1 nas colunas 0e1, se nao tiver imprimi o resultado.
	if(aux2==8){
	for(i=0;i<2;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	i+=3;
	j+=3;
	}}}}
	if(aux2==8){
	printf("\nResultado--> A + C.\n");

	}

	//-----------------------ESSA parte verifica se tem 2 octetos 1 na coluna 0 e 1 e outro na linha 2 e 3

	i=0,j=0,aux=0,aux2=0;
	//verifica se tem 8 uns na coluna 0 e 2
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 8 uns nas colunas 0 e 2
	//entao verifica se tem 8 uns nas linhas 2 e 3
	if(aux==8){
	for(i=2;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	//agora verifica se tem mais algum 1 no mapa, se nao tiver imprimi o resultado.
	if(aux2==8){
	for(i=0;i<2;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	i+=3;
	j+=3;
	}}}}
	if(aux2==8){
	printf("\nResultado--> A + C`\n");

	}
//----------------------------------Inicio comparacao 3 octetos-----------------------------

//------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<2;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux=20){
	for(j=0;j<2;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResultado--> A` + C + B`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==20){
	for(j=2;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResultado--> C` + A` + B`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<t;j+=3){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==14){
	for(j=1;j<3;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> A` + B` + D`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<2;j++){
	if(m[3][j]==1){
	aux+=1;
	}
	if(aux==14){
	for(j=2;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado-->A` + B + C`\n");
	}}
	}}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<2;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=2;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> A` + B + C\n");
	}
	}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<t;j+=3){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==14){
	for(j=1;j<3;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> A` + B + D`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(i=2;i<t;i++){
	for(j=1;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==14){
	for(i=2;i<t;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> A` + D + C\n");
	}}
	aux=8;
	}
	if(aux==8){
	for(i=2;i<t;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==10){
	for(i=2;i<t;i++){
	for(j=2;j<t;j++){
	aux+=1;
	}}
	if(aux==14){
	for(i=2;i<t;i++){
	if(m[i][1]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResposta--> A` + C + D`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(i=2;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	for(i=2;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==14){
	for(i=2;i<t;i++){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado-->C` + A` + D`\n");
	}}}
	aux=8;
	}
	if(aux==8){
	for(i=2;i<t;i++){
	for(j=0;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==14){
	for(i=2;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> C` + D + A`\n");
	}}
	aux=8;
	}
//---------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=2;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	for(j=2;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==18){
	for(j=2;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==18){
	printf("\nResultado--> C` + A + B`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==20){
	for(j=0;j<2;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResultado--> A + C + B`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==20){
	for(j=0;j<2;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResultado--> A + B + C\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==20){
	for(j=2;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResultado-->C` + A + B\n");
	}}}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<t;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==16){
	for(i=0;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==20){
	for(j=1;j<3;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResposta--> A + B` + D`\n");
	}}
	}}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<t;j+=3){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==14){
	for(j=1;j<3;j++){
	if(m[0][j]==1){
	aux+=1;
	}
	}
	if(aux==14){
	printf("\nResultadoo-> A + B + D`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<2;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==14){
	for(j=2;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> A + B + C`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(i=0;i<2;i++){
	for(j=1;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==14){
	for(i=0;i<2;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> A + C + D\n");
	}}
	aux=8;
	}
	if(aux==8){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	for(i=0;i<t;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==20){
	for(i=0;i<2;i++){
	if(m[i][1]==1){
	aux+=1;
	}}
	if(aux==20){
	printf("\nResultado--> C + A + D`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(i=0;i<2;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	for(i=0;i<2;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==14){
	for(i=0;i<2;i++){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> C` + A + D`\n");
	}}
	}
	aux=8;
	}
	if(aux==8){
	for(i=0;i<2;i++){
	for(j=0;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==14){
	for(i=0;i<2;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==14){
	printf("\nResultado--> C` + D + A\n");
	}}
	}

//--------------------------------- Agora verifica se existe 2 octetos 1 na linha 0e1 e outro na coluna 0 e 1.

	//verifica se um octeto nas linhas 0 e 1.
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<2;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 8 uns na linha 0 e 1 entao verifa as colunas 0 e 1
	if(aux==8){
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	//agora verifica se tem mais algum 1 no mapa, se nao tiver imprimi o resultado
	if(aux2==8){
	for(i=2;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	j+=3;
	i+=3;
	}}}}
	if(aux2==8){
	printf("\nResultado--> A` + C`.\n");

	}

// ---------------------------essa parte verifica se 2 octetos um nas colunas 0 e 1 e outo nas colunas 0 e 3.

	i=0,j=0,aux=0,aux2=0;
	//verifica a qtd de uns na coluna 0 a 1 nas linhas 0 a 3
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	//se tiver 8 uns entao tem um octeto e entra na proxima condicao
	//verifica a qtd de uns na coluna 3 nas linhas 0 a 3.
	for(i=0;i<t;i++){
	for(j=3;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	//se tiver 4 uns entao tem outro octeto e entra na proxima condicao
	//verifica se tem mais algum um no mapa, se nao tiver imprimi o resultado.
	if(aux2==4){
	for(i=0;i<t;i++){
	for(j=2;j<3;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	if(aux2==4){
	printf("\nC` + D`.\n");

	}
//--------------------Essa parte verifica se tem dois octetos 1 nas colunas 2e3 e outro nas colunas 3e0

	i=0,j=0,aux=0,aux2=0;
	//verifica a qtd uns na coluna 2e3
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 8 uns nas colunas 2 e 3 nas linhas 0a3 entao entra na proxima condicao
	//verifica a qts de uns na coluna 0
	if(aux==8){
	for(i=0;i<t;i++,j=0){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	//se tiver 4 uns na coluna 0 nas linhas 0a3 entao entra na proxima condicao
	//verifica se tem mais algum 1 no mapa, se nao tiver imprimi o resultado
	if(aux2==4){
	for(i=0;i<t;i++){
	if(m[i][1]==1){
	aux2+=1;
	}}}
	if(aux2==4){
	printf("\nResultado--> C + D`\n");

	}
//----------------------------------Essa parte verifica se tem 2 octetos 1 na coluna 0e1 e outro na coluna 1e2

	i=0,j=0,aux=0,aux2=0;
	//verifica quantos uns tem nas colunas 0,1,2.
	for(i=0;i<4;i++){
	for(j=0;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	for(i=0;i<4;i++){
	if(m[i][3]==1){
	aux2+=1;
	}}
	if(aux2==0){
	printf("\nResultado--> C` + D.\n");

	}}

//----------------------Essa parte verifica se tem 2 octetos nas linhas 0,1,2.
	i=0,j=0,aux=0,aux2=0;

	//verifica quantos uns tem nas linhas 0,1,2.
	for(i=0;i<3;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 12 uns entao tem pelo menos 2 octetos
	//verifica se tem mais algum 1, se nao tiver imprimi o resultado.
	if(aux==12){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	printf("\nResultado--> A` + B.\n");

	}
//---------------Essa parte verifica se tem 2 octetos, um na linha 1e2 e outro na linha 2e3

	i=0,j=0,aux=0,aux2=0;
	//verifica a qtd de uns na linha 1,2,3
	for(i=1;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	//se tiver 12 uns nas linhas, 1,2,3, entao verifica se tem mais algum um no mapa,
	// se nao tiver imprimi o resultado
	if(aux==12){
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	printf("\nResultado--> B + A\n");

	}

//Essa parte verifica se tem 2 octetos 1 na coluna 1e2 e outro na coluna 2e3

	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<4;i++){
	for(j=1;j<4;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	for(i=0;i<4;i++){
	if(m[i][0]==1){
	aux2+=1;
	}}
	if(aux2==0){
	printf("\nResultado-->D + C\n");

	}}
//aGORA COMECA A VERIFICAR OCTETOS E QUARTETOS-------------------

	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<4;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<4;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2=aux2+1;
	}}}
	if(aux2==8){
	for(i=1;i<4;i++){
	for(j=2;j<4;j++){
	if(m[i][j]==1){
	aux2=aux2+1;
	}}}}
	if(aux2==8)
	printf("\nResultado--> C` + A`B`\n");

	}
//-------------------------------------------

	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=2;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=2;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	printf("\nResultado-->C` + A`B\n");
	}}}}
//-----------------------------------------------

	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<4;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<4;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2=aux2+1;
	}}}
	if(aux2==8){
	for(i=0;i<2;i++){
	for(j=2;j<4;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(m[3][2]==1){
	aux2+=1;
	}
	if(m[3][3]==1){
	aux2+=1;
	}
	if(aux2==8){
	printf("Resultado--> C` + AB\n");

	}}}
//--------------------------------------------------

	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<4;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<4;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2=aux2+1;
	}}}
	if(aux2==8){
	for(i=0;i<3;i++){
	for(j=2;j<4;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	if(aux2==8){
	printf("\nResultado--> C` + AB`\n");

	}}
//---------------------------------------------------

	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<4;i++){
	for(j=2;j<4;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	for(i=1;i<4;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	if(aux2==8){
	printf("\nResultado--> A`B` + C\n");
	}}
//----------------------------------

	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	if(m[0][0]==1){
	aux2+=1;
	}
	if(m[0][1]==1){
	aux2+=1;
	}
	if(aux2==8){
	for(i=2;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}}
	if(aux2==8){
	printf("\nResultado-->C + A`B\n");
	}}}
//-----------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	for(i=0;i<2;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(m[3][0]==1){
	aux2+=1;
	}
	if(m[3][1]==1){
	aux2+=1;
	}}
	if(aux2==8){
	printf("\nResultado-->AB + C");
	}}
//-------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	for(i=0;i<3;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	printf("\nResultado-->C + AB`\n");
	}}}
//---------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<t;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	for(i=1;i<t;i++){
	for(j=0;j<t;j+=3){
	if(m[i][j]==1){
	aux2+=1;
	}
	}}}
	if(aux2==8){
	printf("\nResultado--> D + A`B`\n");
	}}
//-------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=0;i<t;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux2+=1;
	}}}
	if(aux2==8){
	if(m[0][0]==1){
	aux2+=1;
	}
	if(m[0][3]==1){
	aux2+=1;
	}
	if(aux2==8){
	for(i=2;i<t;i++){
	if(m[i][0]==1){
	aux2+=1;
	}}
	for(i=2;i<t;i++){
	if(m[i][3]==1){
	aux2+=1;
	}}}}
	if(aux2==8){
	printf("\nResultado--> A`B + D\n");
	}}
//-----------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<2;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<2;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==12){
	if(m[3][0]==1){
	aux+=1;
	}}
	if(aux==12){
	if(m[3][3]==1){
	aux+=1;
	}}
	if(aux==12){
	printf("\nResultado--> AB + D\n");
	}}
	}}
//----------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<3;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<3;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	}
	if(aux==12){
	printf("\nResultado--> D + AB`\n");
	}}}
//-----------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux2+=1;
	}}}
	if(aux2==0){
	for(i=2;i<t;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}}
	if(m[2][0]==0 && m[2][3]==0 && aux==12){
	printf("\nResultado--> AD + B`\n");
	}}
//----------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i=i+3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=1;i<3;i++){
	for(j=1;j<4;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}}
	if(aux==12){
	printf("\nResultado--> C`D` + B`\n");
	}}
//--------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i=i+3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=1;i<3;i++){
	for(j=0;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}}
	if(aux==12){
	printf("\nResultado--> CD` + B`\n");
	}}
//--------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i=i+3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=1;i<3;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}}
	if(aux==12){
	for(i=1;i<3;i++){
	if(m[i][3]==1){
	aux+=1;
	}}}
	if(aux==12){
	printf("\nResultado--> CD + B`\n");
	}}
//-----------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i+=3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=1;i<3;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=1;i<3;i++){
	if(m[i][1]==1){
	aux+=1;
	}}
	if(aux==10){
	for(i=1;i<3;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado--> C`D + B`\n");
	}}
	}}
//--------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<2;i++){
	if(m[i][1]==1){
	aux+=1;
	}}}
	if(aux==10){
	for(i=0;i<t;i++){
	if(m[i][3]==1){
	aux2+=1;
	}}}
	if(aux2==0){
	for(i=2;i<t;i++){
	if(m[i][2]==1){
	aux2+=1;
	}}
	if(aux2==0 && aux==10){
	printf("nResultado--> C` + A`D\n");
	}}
//------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}
	if(aux==8){
	for(i=1;i<3;i++){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==10){
	for(i=0;i++;i+=3){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado--> C` + BD\n");
	}}}}
//-------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<2;i++){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==8){
	for(i=2;i<t;i++){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado--> C` + DA\n");
	}}}
//------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<t;i+=3){
	if(m[i][2]==1){
	aux+=1;
	}}
	if(aux==10){
	for(i=1;i<3;i++){
	if(m[i][2]==1){
	aux+=1;
	}}}
	if(aux==10){
	printf("\nResultado-->C` + B`D\n");
	}}
//---------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<t;j+=3){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=1;j<3;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado--> B` + DA`\n");
	}
	}}
	}}
//---------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i+=3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<2;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==10){
	for(j=2;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado-->B` + A`C`\n");
	}}}}
//-----------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i+=3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=1;j<3;j++){
	if(m[1][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j+=3){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado--> B` + D`A`\n");
	}}}
//-----------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i+=3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<t;j+=3){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==10){
	for(j=1;j<3;j++){
	if(m[2][j]==1){
	aux+=1;
	}}}
	if(aux==10){
	printf("\nResultado--> B` + D`A\n");
	}}}
//---------------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i+=3){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=0;j<2;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==8){
	for(j=2;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==10){
	printf("\nResultado-->B` + A`C\n");
	}}
	}}
//--------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=1;i<3;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	for(i=0;i<t;i+=3){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	printf("\nResultado--> C` + B\n");
	}}}
//---------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<t;i++){
	for(j=2;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=1;i<3;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	for(i=0;i<t;i+=3){
	for(j=0;j<2;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==16){
	printf("\nResultado--> C + B\n");
	}}}
//--------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(j=0;j<t;j++){
	if(m[0][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(j=0;j<t;j++){
	if(m[1][j]==1){
	aux+=1;
	}}
	if(aux==4){
	for(i=2;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	printf("\nResultado--> A + B` \n");
	}}}
//-------------------------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<2;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(j=0;j<t;j++){
	if(m[3][j]==1){
	aux+=1;
	}}
	if(aux==12){
	for(j=0;j<t;j++){
	if(m[2][j]==1){
	aux+=1;
	}}
	if(aux==12){
	printf("\nResultado--> A` + B`\n");
	}}}
//---------------------------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=0;i<2;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=2;i<t;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}
	}
	}
	if(aux==12){
	for(i=2;i<t;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	for(i=2;i<t;i++){
	if(m[i][3]==1){
	aux+=1;
	}
	}
	if(aux==12){
	printf("\nResultado--> D + A`\n");
	}}}
//----------------------------------------
	i=0,j=0,aux=0,aux2=0;
	for(i=2;i<t;i++){
	for(j=0;j<t;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==8){
	for(i=0;i<2;i++){
	for(j=1;j<3;j++){
	if(m[i][j]==1){
	aux+=1;
	}}}
	if(aux==12){
	for(i=0;i<2;i++){
	if(m[i][0]==1){
	aux+=1;
	}}
	if(aux==12){
	for(i=0;i<2;i++){
	if(m[i][3]==1){
	aux+=1;
	}}}
	if(aux==12){
	printf("\nResultado--> C` + A\n");
	}
	}
	}
	}
main(){
	int m[4][4],i,j;
	printf("\t  ||\t\t\tMapa de Karnaugh.\t\t||\n");
	printf("\t  ||____________________________________________________||\n\n");
	printf("\nDigite 0 ou 1!\n\n");
	//A(NEGADO)B(NEGADO)
	do{
	printf("A` B` C` D` --> ");
	scanf("%d",&m[0][0]);
	if(m[0][0]>1||m[0][0]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[0][0]>1||m[0][0]<0);
	do{
	printf("\nA` B` C` D  --> ");
	scanf("%d",&m[0][1]);
	if(m[0][1]>1||m[0][1]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[0][1]>1||m[0][1]<0);
	do{
	printf("\nA` B` C  D  --> ");
	scanf("%d",&m[0][2]);
	if(m[0][2]>1||m[0][2]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[0][2]>1||m[0][2]<0);
	do{
	printf("\nA` B` C  D` --> ");
	scanf("%d",&m[0][3]);
	if(m[0][3]>1||m[0][3]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[0][3]>1||m[0][3]<0);

	//A(NEGADO)B(SEM NEGAR)
	do{
	printf("\nA` B  C` D` --> ");
	scanf("%d",&m[1][0]);
	if(m[1][0]>1||m[1][0]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[1][0]>1||m[1][0]<0);
	do{
	printf("\nA` B  C` D  --> ");
	scanf("%d",&m[1][1]);
	if(m[1][1]>1||m[1][1]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[1][1]>1||m[1][1]<0);
	do{
	printf("\nA` B  C  D  --> ");
	scanf("%d",&m[1][2]);
	if(m[1][2]>1||m[1][2]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[1][2]>1||m[1][2]<0);
	do{
	printf("\nA` B  C  D` --> ");
	scanf("%d",&m[1][3]);
	if(m[1][3]>1||m[1][3]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[1][3]>1||m[1][3]<0);

	//A(SEM NEGAR)B(SEM NEGAR)
	do{
	printf("\nA  B  C` D` --> ");
	scanf("%d",&m[2][0]);
	if(m[2][0]>1||m[2][0]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[2][0]>1||m[2][0]<0);
	do{
	printf("\nA  B  C` D  --> ");
	scanf("%d",&m[2][1]);
	if(m[2][1]>1||m[2][1]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[2][1]>1||m[2][1]<0);
	do{
	printf("\nA  B  C  D  --> ");
	scanf("%d",&m[2][2]);
	if(m[2][2]>2||m[2][2]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[2][2]>1||m[2][2]<0);
	do{
	printf("\nA  B  C  D` --> ");
	scanf("%d",&m[2][3]);
	if(m[2][3]>1||m[2][3]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[2][3]>1||m[2][3]<0);

	//A(SEM NEGAR)B(NEGADO)
	do{
	printf("\nA  B` C` D` --> ");
	scanf("%d",&m[3][0]);
	if(m[3][0]>1||m[3][0]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[3][0]>1||m[3][0]<0);
	do{
	printf("\nA  B` C` D  --> ");
	scanf("%d",&m[3][1]);
	if(m[3][1]>1||m[3][1]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[3][1]>1||m[3][1]<0);
	do{
	printf("\nA  B` C  D  --> ");
	scanf("%d",&m[3][2]);
	if(m[3][2]>1||m[3][2]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[3][2]>1||m[3][2]<0);
	do{
	printf("\nA  B` C  D` --> ");
	scanf("%d",&m[3][3]);
	if(m[3][3]>1||m[3][3]<0){
	printf("\nDigite 0 ou 1!\n\n");
	}
	}while(m[3][3]>1||m[3][3]<0);
	printf("\n\t\tC` D`\t\tC` D\t\tC D\t\tC D`\n\n");
	for(i=0;i<4;i++){
	if(i==0){
	printf("A` B`   \t");
	}else if(i==1){
	printf("A` B    \t");
	}else if(i==2){
	printf("A  B    \t");
	}else if(i==3){
	printf("A  B`   \t");
	}

	for(j=0;j<4;j++){
	if(m[i][j]==2){
	printf("X\t\t");
	}else{
	printf("%d\t\t",m[i][j]);
	}}
	printf("\n");
	}
	//Chama a funcao para verificar se tudo e 1 ou se tudo e 0.
	verifica1ou0(m,4);
	//Chama a funcao para verificar.
	verificaoctetos(m,4);

	}


Should we export weekly or daily?


yr


> I think it is better to add  __attribute__((weak))  in  user_rf_cal_sector_set  and  user_rf_pre_init , let it can changed by user.

I thought that too.  However, I then remembered a peculiarity with how static libraries are handled.  Forgive me if I get some of the terms wrong, I am working from memory here.

An archive (static library) member (object file) is only linked into a binary if there is an otherwise unsatisfied symbol in that member.  At that point, the entire member is linked into the binary.  Because each of those two functions (symbols) are defined in their own object file (member), those members will ONLY be pulled into the binary if their respective symbols were not already defined (say, by an explicitly specified .o file to the linker).  Hence, no duplicate symbol error.  There is a potential for issue, however, if you define those symbols in a similar manner (archive member that would not be otherwise pulled in).  In that case it would depend on the order that the archives are specified to the linker which will be preferred by the linker.

All of this is unverified, purely from memory of the linker rules.


cool


Gee dude, you've been working on this for an age. Glad to see you're finally using github ;)


I don't see how these constraints would prevent the use of the default constructor...


No one cares...


https://github.com/oe-alliance/oe-alliance-core/commit/85329d5c757ec7c921e2bab1dd35d4501534107b
spelling issue in oe-alliance-wifi. filename of bitbake is different


It should print [1], have all the dependencies installed. :deciduous_tree:


totally without this change it was horrible.

0/10 would not try again


Configurar repositório


The wiring diagram shows 2 different +5v pins, but the board only has one, and the example you show lists three grounds but the diagram only shows two.  Is pin 8 from the CD-i supposed to be a 2nd ground?  In the diagrams of a 8 pin mini DIN the yellow and black wires are both listed as ground and I believe those would be pins 5 and 8.


nUmber


можно написать так:
`if (sum % 2) {
...
}`


даже если в блоке `if / else / for / while ...` один оператор, скобочки поставить таки стоит. Код будет более читабельным


зачем этот импорт?


в общем всё не довольно хорошо


@sorawee yes, thanks for catching.


Sorry for the short header. I pressed the green button before i filled in a proper heading 😊


Send money bank account soppy and tomorrow


extraer a constante


even after giving the pip install command pygoogle
still giving the same error.

Traceback (most recent call last):
  File "C:\scan\letmefuckit.py", line 7, in <module>
    from pygoogle import pygoogle
ImportError: No module named pygoogle


checkear si explota


это реализовано в задаче 13


I agree that in the context of the full GitHub URL, the `oci-` is redundant.  But the installed tools will presumably be `oci-*-tool`, and [it's nice if the repo name matches the installed command][1].

[1]: https://github.com/RobDolinMS/tob/commit/4fa747360729bc9c588ce78b2382fa3f59bc14f5#commitcomment-18712958


Missing a trailing period.


Native ```Map``` detection may fail with core-js polyfill
https://github.com/lodash/lodash/commit/e156459176c1f35964fc443b39f04c4cb0a96763#diff-001d0647fb00f8336795faccdec19a31R11199


Work towards #6


ocitools also currently contains code for generating and validating configuration files.  Is that part of the initial mandate?  Is ocitools free to branch out in those directions without an official TOB mandate to do so?


Is there an expectiation that image-spec will grow an API similar to the one proposed in opencontainers/runtime-spec#513, after which the image-tools project would also presumably want to validate image-spec implementations (in addition to your suggestion here for validating the images themselves).


“contributotors” → “contributors”


another SUUUPER important fix that completely broke this program.

*wew lads*


Hi Jeeze,

Please check this when you have a chance:
https://github.com/mamedev/mame/pull/1331
I've done basic testing here and it seems to work fine, please let me know
if the behaviour is the expected.

Cheers,

Calamity

2016-08-15 9:49 GMT+02:00 ImJezze <notifications@github.com>:

> It seems we have to consider every configuration.
>
> Then I would suggest to implement -unevenstretchy and an additional boolean
> flag (e.g. -orientationaware) to enable swapping of the x/y settings
> depending on the source/target orientation. This flag would be false
> (default) for CRT users and can be set to true for TFT users.
>
> What do you think about?
>
>
> 2016-08-15 1:06 GMT+02:00 antonioginer <notifications@github.com>:
>
> > >
> > > Correct me if I'm wrong. But a game with portrait orientation + 0° on a
> > CRT
> > > would not make much sense.
> >
> >
> > It's indeed heterodox, but believe it or not, 99% of people using
> cabinets
> > with horizontally mounted monitors are playing vertical games that way.
> So
> > it's an use case we definitely need to consider.
> >
> > The same goes for landscape orientation + CW90°.
> > >
> >
> > That one is less common, sure.
> >
> >
> > > A new option like -unevestretchy can help, but you will have to create
> > > different configurations for portrait and landscape.
> >
> >
> > I know, it sounds less elegant, but it needs to be.
> >
> >
> > If -unevestretchx
> > > would be always applied on the long side of the source, no
> > differentiation
> > > in the configuration is necessary. If I'm not mistaken this would not
> > > affect the CRT use cases above.
> >
> >
> > That would mean -unevenstretchx could be applied randomly either on the
> > direction of the target monitor scanlines o perpendicularly to them. That
> > hijacks the original intention which was having an option that would
> > unmistakably apply fractional scaling over the target physical scanlines.
> >
> > —
> > You are receiving this because you were mentioned.
> > Reply to this email directly, view it on GitHub
> > <https://github.com/mamedev/mame/commit/161a08dd4acd792c71d665d3abc16c
> 3093053de8#commitcomment-18636412>,
> > or mute the thread
> > <https://github.com/notifications/unsubscribe-auth/
> ALaNpzBpv1FnFj2HAn55t9wMpk5d730tks5qf591gaJpZM4JjyL4>
>
> > .
> >
>
> —
> You are receiving this because you commented.
> Reply to this email directly, view it on GitHub
> <https://github.com/mamedev/mame/commit/161a08dd4acd792c71d665d3abc16c3093053de8#commitcomment-18638135>,
> or mute the thread
> <https://github.com/notifications/unsubscribe-auth/AQDAEUTG729UHu9l-eYwMymx_5xhuPTIks5qgBn0gaJpZM4JjyL4>
> .
>


ну это же мой почерк) это так надо)


this was commit 10,000 !!! 🎉 🎉 🎉 🎉 🎉 🎉 🎉 🎉 🎉 🎉

ping @cmfcmf @Guite


Actually I added cloning functions for world objects and scenarios. Also, I updated the active scenario to be a copy of the scenario selected from the list of scenarios, instead of the index into the SCENARIOS ArrayList.


@kam187 i actually have 0 plugins installed


For some reason, this commit didn't actually track/add any of my changes.


Hola


@sorawee Though it's not expressed in their type (and maybe not yet expressible?), these functions would work on anything implementing the basic arithmetic and comparison operators.  In that way, it's not altogether different from having the `sort` method in the lists module (except a little better, because `sort` is defined on _all_ lists, even unsortable ones).


How can you change such a dramatic thing without any documentation!


Thanks. I had skimmed over the `debug_unit` function, but I overlooked the special handling of the status key. :flushed:


Não importa o padrão, isso é feio em qualquer universo. Coloque o `return 0` no `main`, nem você gosta de omitir isso, esquece defesa.

Se considerarmos que compilou e tá no standard é ok, JS é bom também.

Coloque o return.


I also left a comment on your blog post about this, but this filter should be used with caution, as there could be other plugins with front-end forms (like a cmb2-user-registration plugin) which this would "break". As with all global filters, they should only be used in the conditions you need them. I would appreciate at least some cautionary inline comments stating as much.


Isn't this change specific to OS X?


Cram them in the cargo bay, they don't have to be comfortable, they just need air and water for a few days.


Isn't it better to move beta and nightly to allow failures?


This is a breaking change, since `within` constrains the parameterized type of `List` to `Number`. Previously `sort` could be called on any value with a `_lessthan` method.

Should `sort` be demoted to a function and its type signature changed to `List<Number> -> List<Number>`?


Now that I see it it's simple. Thanks.


This breaks the `pokerth` package. Was there a reason for removing these lines?


Pomyłka przy godzinie, chodziło o 15:58.


that doesnt make sense they arent unbanned they are banned..


please delete this package Barjis , the main package is core...


I thought that it was an ugly hack because we essentially changed all the SDL structure and patched all libraries to move them to include. I wanted to change this long time ago -- instead I've made it so that `sdl-config` (and `sdl2-config`) report paths to all SDL plugins (that's the proper way to discover SDL). I'm willing to fix all the breakage, sorry for this!


this change broke looting in group if the loot recipient player is not connected when other group members try to loot , issue #13300


oh shit


it sometimes looks better to have a number of blank lines at the end of a file. Maybe this is too restrictive?