javascript – Looking for the basics to write neat programs D3.js

I am looking for a review of the simple program below, which displays two counters and increments them via a button, using D3.js.

I want to stay in function invocations and integrate seamlessly into D3. In particular, I do not want to use the constructor or prototyping invocation templates. More concretely, I would not like to use class or New.

I would also like to avoid constantly asking myself "what is it?" this at this moment? "by initializing this, as you see in the code (let's start arguing that this is sometimes quite convincing for another occasion).

Increment function (name, value) {
leave this = {};

that.init = function () { = name;
that.span = (& # 39; body & # 39;)
.append (& # 39; span & # 39;)
.attr ('id', '# num' + name)
.text (value);
this.init ();

that.increment = function () {
let i = parseInt (that.span.text ()) + 1;
.text (i);
return that;
var incrementer1 = Increment ('one', 10);
var incrementer2 = Increment (& two, 20);

double_increment function () {
incrementer1.increment ();
incrementer2.increment ();
} (& # 39; # inc & # 39;)
.on (& # 39; click & # 39 ;, double_increment);

// (& # 39; # inc & # 39;)
// .on (& # 39; click & # 39 ;, increment1.increment);
// (& # 39; # inc & # 39;)
// .on (& # 39; click & # 39 ;, increment2.increment);

At this point, I miss a good way to avoid the function double_increment. Of course, without this function (if we were using the click comment comment pair), we would have a bug. Only one click manager can be defined. We do not have a mechanism to add multiple addEventListeners.

So, to summarize:

  1. We define ça.init like our initializer. This seems more orderly than leaving the initialization code loose in the body of the function. But to define it and call it immediately seems strange. Can you improve this?
  2. How would you avoid the ugly double_increment to work in a D3 program?

que.span.text () should probably be replaced by ça.span.datum, if I can find the data in it. But we would like to avoid duplicating the counter in incrementer. In this way, we do not have to worry about the counter and the desynchronization of its display. The data itself, once localized, is already a bit of a duplication (necessary).

simultaneity – Multithreaded parametric programs with superexponential shared memory size in the number of threads?

In this question, a program designates a parameterized multithreaded program with interleaving semantics, a finite number of states per thread (which can depend on the number of threads) and a finite number of shared states (which may depend on the number of threads) .

A shared state is a valuation of shared memory, and a per thread (in another terminology, local) State is the valuation of the memory thread-local (we assume no stack). interweaving semantics means that threads' actions are interleaved on a single processor and that a thread has direct access to shared memory and its own local memory, with no access to local memories of other threads. parameterized means that we consider a family of programs generated from a finite description model such as the $ n $The family member has $ n $ threads (which usually coincide up to the thread identifier).

To the best of my knowledge, for such a program, the size of the shared state space is between constant (for example, for a single Boolean lock variable) and exponential (for example, protocol of #). Peterson's mutual exclusion) in the number of threads. $ n $.

Is there a well-known academic program in which the size of the shared state space increases superexponentially in $ n $?

Computer Architecture – If Intel Pentium processors were not compatible with programs written for its predecessor, it could have been designed to be a faster processor

I find this question while solving a bank of government employment questions. If anyone could provide the answer with a small explanation, it would be very helpful.

Questions: – If Intel Pentium processors were not compatible with programs written for its predecessor, it could have been designed to be a faster processor.

  1. The statement is true
  2. The statement is false
  3. Speed ​​can not be predicted
  4. Speed ​​has nothing to do with compatibility

(I did not find any label as a microprocessor or something like that, so I have to keep it under the label computer architecture, sorry for that but I did not have a sufficient reputation for creating a label.)

boot – Adding programs when Windows 10 starts using the task manager

I'm aware that when I want to run a program on Windows startup, I'm supposed to add a shortcut to the following folder:

C:  Users [username] AppData  Roaming  Microsoft  Windows  Start Menu  Programs  Startup

However, there is also a Startup tab in Task Manager, where you can enable / disable specific applications running at startup. I like it better because it gives me a single logical location to control that.

Unfortunately, I am unable to find a way to add / remove programs manually. When an application asks me if I want to run it from startup and that I confirm, I presume that it changes something in the registers and that the application appears in the list in the Task Manager.

Can I directly edit the start list in the task manager or do I need to check the logs? Or do I really have to manage this using this silly folder?

Crypto Connect LLC – – Hybrid Programs

I am not the administrator and not the owner of the project. All information is extracted from the project site. The subject has been created for the purpose of informing and is not a call to action.

Languages: RU-EN-DE-ZH-PL-JA-AR

Crypto Connect LLC

The description:

The future comes quickly every second! Hundreds of inventions and novelties allow everyone to earn money using the knowledge and skills of others. We have a team of like-minded people. Each specialist monitors his segment of the global information space in search of new lucrative opportunities and offers. We are interested in: media startups, Blockchain technologies, the world of crypto-currencies, neural networks, 3D technologies, medical developments, virtual reality, the computer sphere and all that allows you to earn money. Money quickly and legally. Each potentially lucrative proposition is evaluated by our lawyers, analysts and bankers. We do not risk, we monetize the opportunities.

Investment plans:

+ 4% AT DEPOSIT FOR 24 HOURS (104%)


MIN. SUM: $ 25.00
MAX. TOTAL: $ 50,000.00
Disbursements: automatic
Features: SSL, DDOS


a Date: 06.04.2019 10:14:56 (UTC + 3)
Recipient Cmdlet: cryptoconnect /
Comments: Opening of Connect Crypto Contribution
Order ID: 31
Paying Code: 97658965
Payment system: Payeer
Amount: 30.00 USD


PinapFile Pay Per Install – Install programs and get paid


PinapFile is a Pay Per Install program, it pays users for each installation of the PinapFile software.

How to use?

1) A user clicks on the link and downloads the PinapFile installation program.
2) A user installs the PinapFile software
3) Then the real files are downloaded

Example: (Hacxx Torrent search engine)

Visit and register

PinapFile Pay Per Install – Install programs and get paid

ux designer – funds graduate programs in ischool

I am a computer science student and would like to pursue my graduate studies in HCI to finally become a UX researcher. Since most of the HCI programs are offered at information schools other than engineering and computer science schools, I was wondering how to fund graduate students. differs from primary schools to engineering schools? (if there is a difference)

macos – Newly installed programs always appear with external drives in the Finder

When you download an application, it often enters a "disk image" (a .dmg file). This is a virtual volume, which appears exactly like the other disks in your desktop, once you have launched it.

You must copy the application from there to your folder / Applications. (Disk images often contain an alias in your Applications folder, so you can easily drop the application into it.
Or, if the image contains an application or an installation package, you must run the installation application.

Once you are done, you can eject the disk image and delete the .dmg file. If you have not copied the application or did not install it, you must make sure that it is done first. – Hybrid Programs – TopGoldForum


Fxjunior Limited Review – Earn 1% – 5% per day for 120 days (PAYMENT)
Released on April 21, 2019
Fxjunior Limited is the collective of a new formation and a professional orientation of its actions of placement. It can be used as a guideline. Fxjunior Limited

It is a process of financial system development.

Technology and investment solutions of our company. Forex trading. You can win it. We are always close, we are always ready.

It is a priority for you to invest in There is no need for a company.

In order to withdraw your profits. You can check your dashboard.
The minimum deposit amount is $ 20. The minimum withdrawal amount is $ 1. All withdrawal requests are processed.

Part Basic Information
the registration number the update soon
Namecheap hosting provider
SSL Sectigo Limited
Investment plans 1% – 5% daily for 120 days
the minimum investment $ 20
Remove Minimum $ 1.00 Perfect Money, $ 5 Bitcoin
Removing the type of the manual
Payment accepted Bitcoin, PerfectMoney, dogecoin, Dashcoin, Litecoin, BitcoinCash, Ethereum
Company Company | location United Kingdom
the Domain a Registered March 25, 2019 – March 25, 2020

All statutes and static deposits can be viewed at

Professional team: They have a professional team. You can make a profit.

Benefits: All profits will be calculated on the balance of your account. You can withdraw your own

payment system at any time. Withdrawals are manual.

User-friendly interface: if you are a beginner or a veteran in the field of investment, do you really need it? It is easy to navigate.

SSL security: They use the password and the PIN code. All your money is kept safe with us at all times.
24/7 customer support: they must meet the needs of your customers.



Turing Machines – Theory for "Integrated" Programs in Other Programs?

We can make the following distinctions: (I will use the terms "program" and "machine" as synonyms).

  1. A machine (basic). This can be formalized by a Turing machine. He receives an entry and calculates an exit entirely by himself.

  2. An oracle machine $ T $. This is a Turing machine, but with an extra feature: it can use a black box "oracle" as a subroutine.

  3. A ??? machine $ T $. It's a machine that does not have subroutines like an Oracle machine. Rather, it is a subroutine of some black box machine (parent?) $ P $.

The third type is supposed to capture the idea of ​​"addiction injection". Suppose we have a fixed parent machine $ P $, which takes as input our machine $ T $and uses it (in some way) to calculate its output.

  • In the case of Oracle machines $ T $, we can "plug" an oracle $ O $ in $ T $and study what can be achieved in $ T $ given this oracle.

  • in the case of ??? machines, we do the opposite: we "branch" $ T $ in $ P $and see what can be achieved in $ T $ Given the constraint that it will be used as a sub-program by $ P $.

The question is: what can we do $ P $ calculate, by programming $ T $, given the constraint that $ T $ will be used in one way (depends exactly on the specific context that interests us) by $ P $? ie what functions are "$ P $-computable "

Some observations:

  • Oracle machines $ T $ with oracle $ O $ can calculate at least as much as Turing machines, since they can simply ignore the oracle.

  • ??? machinery $ T $ with a parent " $ P $ can calculate less that Turing machines because they are forced to be used by $ P $ in a way that the programmer of $ T $ can not control. At two extremes: (1), $ P $ can simply ignore $ T $in which case there is only one "$ P $"calculable", namely $ P $ calculated. (2) $ P $ can literally copy his entry into $ T $and the output of the output of $ T $, in which case each function computable by Turing is also "$ P $-computable "Between these two extremes, $ P $ can use $ T $ as a subroutine, and use the output in a restricted way.

Alternatively, here is a more "mathematical" way of saying this:

Suppose we have a space $ mathcal C $ of "computable functions" (eg, Turing-calculable), and we have a "parent function" $ P: mathcal C to mathcal C $. $ P $ takes a computable function $ c $ (the function that is calculated by the turing machine $ T $ in our previous formulation), and generates a computable function $ P (c) $ (the function that is calculated by giving $ P $ machines $ T $ as a subroutine). The question now is: what is the image of $ P $? here are the $ P $functions -computable.

Is there a theory about something like that?