search for: disfavoring

On 08/02/15 14:24, Pete Geenhuizen wrote: > > On 02/08/15 07:45, Ned Slider wrote: >> >> On 08/02/15 12:33, Pete Geenhuizen wrote: >> No, you don't have the package kmod-nvidia-340xx installed. You have >> kmod-nvidia VERSION 340.65. In the first example, the package NAME is >> kmod-nvidia-340xx (the -340xx is part of the package name, NOT the >>

On Jan 31, 2019, at 11:12 AM, mark <m.roth at 5-cent.us> wrote: > > Why would *ANYONE* think that everyone should just start from scratch, > taking all the time in the world to get it converted? If the conversion were simple enough to be easily automated, the new system is probably no more than just a syntactic difference away from the old, and thus does not provide any

Hi, Fair warning this may be a bit rambling, and is definitely a bit long. I am trying to prototype a system for doing dynamic policy-based routing (source address dependent based on reverse routes from BGP or other dynamic routing protocols.) We need to do this due to a cacophony of factors I won''t get into. To do so the general plan is to store dynamic routes in their own table,

Hello, thanks for bringing this topic up, and it would be excellent if we could come of with a generic solution for this in base R. It is one of the top frequently asked questions and requested features in parallel processing, but also in sequential processing. We have also seen lots of variants on how to attack the problem of reporting on progress when running in parallel. As the author

...on groups, > for example, and assumes very c-like rules in several places around the > sequencing of access types. > Also note that in the language of access paths, C allows overlapping that > does not exist in, for example, Java > > > Is this a statement generally favoring or disfavoring having the frontend > encode the path explicitly? > > (This is true in both the points-to and type-based domains). > Ada has discriminated unions (and you could not use the "union" in this > proposal to represent them) > > > Yes, but discriminated unions also have...

<just want to focus on these parts for a second. *All* of these representations are really access path representations, just encoded slightly different ways, and, as a result, with various parts of the rules in slightly different places> Imagine that we took the enhancement we previously discussed, but instead > of implementing it directly, we just directly encoded for every access the

Hello R-devel, A function to be run inside lapply() or one of its friends is trivial to augment with side effects to show a progress bar. When the code is intended to be run on a 'parallel' cluster, it generally cannot rely on its own side effects to report progress. I've found three approaches to progress bars for parallel processes on CRAN: - Importing 'snow' (not

I don’t know what you meant to imply by “residual clause” — if you meant “it’s not particularly important”, then I suggest it is left out entirely. Apparently at least a few of us have interpreted it to say “the committee reserves the right to kick you out for any behaviour that violates our standards which you exhibit anywhere, even if it is completely unrelated to the llvm community”.

That's just a residual clause. It's not sanely possible to enumerate all the possibilities here (IE if you stalk and murder someone in the llvm community, you are going to get kicked out of the community, regardless of if you did it in a controlled space) I mean, i'm subject to legal ethics rules that are very similar, and those could get me kicked out of an entire profession :) I