I looks very intelesting, but I searched the documentation and could not find any mention of transactions. How do they handle that?
I mean how do they handle locking with things such as SELECT FOR UPDATE? I mean if to clients different SELECT FOR UPDATE fon the same row, could you not have a situation where one client have the lock on db1 and an other client have the lock on db2 for the same row?.
And how do they handle transaction order. I mean if to transactions a and b are comitted at the same time, could you not risk, that one database first commit a and then b, while the other commit b first and then a, leading to inconsistent databases.
The only way I can se to handle this, is to have the software be total single threaded with only one thread sending read/write requests to the databases and then block until all databases had acknowledget them. But that would be slow.
And the problem happens as soon as you want to know which producs uses a specific screw. Doing that query against the xml would be difficult, and/or extreamly slow.
Here is a better solution. Write the decoder in c++ using Vector insted of arrays, and use at(pos) insted of []. That way the worst thing that can happend is an exception which is not a security risk.
(This solution still have the problem that there might be input which causes it to block forever, thus allowing a dos attack, so if you really want security you need to validate the header anyway).
But linux did NOT write an os. He wrote a kenrel which acording to the link is about 10.000 linies of code. The rest of the os and the compiler he got from other sources, mostly gnu. (There is a reason some people want to call it gnu/linux)
>Even difficult problems like the travelling >salesman or Towers of Hanoi
Since when have towers of hanoi been a diffucult problem? It's such a simple problem that it can be implemented for an Apple II in basic.
And for the travelling salesman problem: Well it is easy to solve in the way that we know how to solve it. Try all combinations and select the shortest. The problem with this "solution" is that for any large dataset(Say 10000 cities) no amount of computer power* can solve this problem before Earth hit the sun.
If you know a faster way to solve travelling salesman I think you should describe it, publish it and earn that million dollers.
*(No amount of computer power means that there is not enough matter in the known universe to build a computer that can solve the problem fast enough)
ps: Sorry about feeting the trolls but I got nothing better to do.
O(1) does not mean that the calculations are constant, or that they take constant time. It means that there exists an upper limit(in time) as to how long the operation will take no matter the input size.
Most likely problem. No dma support for your chipst in qnx. Just think about it. Your harddisk can't read more then 40MB/second, and any kind of computer sold widthin the last 7 years should able to copy 40MB in far less then a second.
No it is running (part of)the bsd kernel as a task similary to all the other tasks that it is running.
To understand the mix of bsd and next have a look at
What is Mac OS X
http://www.kernelthread.com/mac/osx/
Well it is not imposible. They do have something like 40% now, so they just need to increase 10% point. Diffucult but not imposible. He is talking about graphics card sale, not integrated graphics where he admit they are currently weak.
But I still think that they should have asked about their (lack of)driver quality.
Java is not one platform. Java is a lot of platforms . There is java java 1.0.x 1.1.x 1.2.x 1.3.b 1.4.x.
As a developer having to support java 1.1.8, 1.3.x and 1.4.2 it is really fucked as I have to edit the source each time I want to compile it for our tre supported java platforms. And I can't just use java1.4.2 and then tell people to upgrade their java, because our software need to run on platforms where upgrading the java to 1.4 would require an upgrade of the entire OS.
>It certainly is not free software, but that doesn't >mean it cannot be included in a linux distribution.
The licence for java(jre 1.4.2) is the reason you can't distribute it with your linux distribution.
Just look ath this quote from the licence:
B.License to Distribute Software. Subject to the terms and conditions of this Agreement, including, but not limited to the Java Technology Restrictions of these Supplemental Terms, Sun grants you a non-exclusive, non-transferable, limited license without fees to reproduce and distribute the Software, provided that (i) you distribute the Software complete and unmodified (unless otherwise specified in the applicable README file) and only bundled as part of, and for the sole purpose of running, your Programs, (ii) the Programs add significant and primary functionality to the Software, (iii) you do not distribute additional software intended to replace any component(s) of the Software
The linux distributions could ofcause sidestep tha t licence by making and including a java program, but then who has to deside if the Programs add significant and primary functionality to the Software
Slashdot Mirror
Just use Apache 1.3 insted of 2.0 and it will stay up until you deside to take it down.
Zonealarm don't have any problem with blocking connections from the inside. It really don't require access to the source of windows.
Whats the problem with running VACUUM? You just start VACUM as a cronjob. It's not as if it stops the database from working.
I looks very intelesting, but I searched the documentation and could not find any mention of transactions. How do they handle that?
I mean how do they handle locking with things such as SELECT FOR UPDATE?
I mean if to clients different SELECT FOR UPDATE fon the same row, could you not have a situation where one client have the lock on db1 and an other client have the lock on db2 for the same row?.
And how do they handle transaction order. I mean if to transactions a and b are comitted at the same time, could you not risk, that one database first commit a and then b, while the other commit b first and then a, leading to inconsistent databases.
The only way I can se to handle this, is to have the software be total single threaded with only one thread sending read/write requests to the databases and then block until all databases had acknowledget them. But that would be slow.
Yes but the number is stored as ascii, so there is no reason to belive it is limited to 32bit integers.
So it's better if some random oem such as dell choose what browser most users use, insted of microsoft choosing it?
You could just send a correct mime type from your script AS YOU SHOULD ANYWAY.
And the problem happens as soon as you want to know which producs uses a specific screw. Doing that query against the xml would be difficult, and/or extreamly slow.
Martin
Here is a better solution. Write the decoder in c++ using Vector insted of arrays, and use at(pos) insted of []. That way the worst thing that can happend is an exception which is not a security risk.
(This solution still have the problem that there might be input which causes it to block forever, thus allowing a dos attack, so if you really want security you need to validate the header anyway).
Martin
Well, that's the mistake. What you are really paying for is mostly the development of the processor.
But linux did NOT write an os. He wrote a kenrel which acording to the link is about 10.000 linies of code. The rest of the os and the compiler he got from other sources, mostly gnu. (There is a reason some people want to call it gnu/linux)
>Even difficult problems like the travelling >salesman or Towers of Hanoi
Since when have towers of hanoi been a diffucult problem? It's such a simple problem that it can be implemented for an Apple II in basic.
And for the travelling salesman problem: Well it is easy to solve in the way that we know how to solve it. Try all combinations and select the shortest. The problem with this "solution" is that for any large dataset(Say 10000 cities) no amount of computer power* can solve this problem before Earth hit the sun.
If you know a faster way to solve travelling salesman I think you should describe it, publish it and earn that million dollers.
*(No amount of computer power means that there is not enough matter in the known universe to build a computer that can solve the problem fast enough)
ps: Sorry about feeting the trolls but I got nothing better to do.
Math 101
O(1) does not mean that the calculations are constant, or that they take constant time. It means that there exists an upper limit(in time) as to how long the operation will take no matter the input size.
No it's not. The GPU is only used to compose the gui.
But what if you want first edit one file, and then an other file. Your solution require that one quit geedit to switch file.
It's not poorly tested. They know the bug they just released anyway.
Acording the thread in the link, it is actuelly Fedore that mess with the partition table.
Most likely problem. No dma support for your chipst in qnx. Just think about it. Your harddisk can't read more then 40MB/second, and any kind of computer sold widthin the last 7 years should able to copy 40MB in far less then a second.
No it is running (part of)the bsd kernel as a task similary to all the other tasks that it is running. To understand the mix of bsd and next have a look at What is Mac OS X http://www.kernelthread.com/mac/osx/
But then it's not the license that is evil, but the price.
What does easily-refreshed configs for hosting? I always just use apachectl graceful.
That would not work. You could just remove the signature. Nobody need the signature to hear the music, so removing it would do no harm.
Well it is not imposible. They do have something like 40% now, so they just need to increase 10% point. Diffucult but not imposible. He is talking about graphics card sale, not integrated graphics where he admit they are currently weak.
But I still think that they should have asked about their (lack of)driver quality.
Martin
Java is not one platform. Java is a lot of platforms . There is java java 1.0.x 1.1.x 1.2.x 1.3.b 1.4.x.
As a developer having to support java 1.1.8, 1.3.x and 1.4.2 it is really fucked as I have to edit the source each time I want to compile it for our tre supported java platforms. And I can't just use java1.4.2 and then tell people to upgrade their java, because our software need to run on platforms where upgrading the java to 1.4 would require an upgrade of the entire OS.
The licence for java(jre 1.4.2) is the reason you can't distribute it with your linux distribution.
Just look ath this quote from the licence:
The linux distributions could ofcause sidestep tha t licence by making and including a java program, but then who has to deside if the Programs add significant and primary functionality to the Software