Документ взят из кэша поисковой машины. Адрес оригинального документа : http://www.fds-net.ru/showflat.php?Number=10321717&src=&showlite=l
Дата изменения: Unknown
Дата индексирования: Tue Apr 12 02:45:34 2016
Кодировка: Windows-1251
Программисты шутят - Public forum of MSU united student networks
Technical >> Development

Страницы: | 0 ... | << | 140 | 160 | 180 | 200 | 220 | 240 | 260 | 280 | (281) | 300 | 320 | 340 | 360 | 380 | 400 | 420 | ... 820 | >> | показать все | след. страница
CROTishka : Re: write in C  [re:Demetr]   22.07.2011 12:32    | Reply | Edit |
37
побояню:
В ответ на:

Паралимпиада по программированию. Приглашаются программисты на РНР, 1С и VBA




Начать обсуждение

blind   [re:CROTishka]   30.07.2011 00:33    | Reply | Edit |
7
/user/upload/file418330.jpg

Обсуждение этого сообщения (2)

dtbeaver   [re:blind]   15.08.2011 16:59    | Reply | Edit |
4

 
code:
class o { public: virtual o& operator ()() = 0; virtual bool operator || (o&) = 0; virtual o& operator = (o& o) = 0; };


Обсуждение этого сообщения (3)

ManMachine   [re:dtbeaver]   18.08.2011 02:31    | Reply | Edit |
21
Обновление висящих на стене возле рабочего места распечаток, по случаю.

/user/upload/file17652.png

Обсуждение этого сообщения (9)

blind   [re:ManMachine]   21.08.2011 21:32    | Reply | Edit |
2
/user/upload/file421100.jpg

Обсуждение этого сообщения (2)

Fj_   [re:ManMachine]   30.08.2011 18:46    | Reply | Edit |
16
#include <iostream>

template<class T>
inline std::ostream& operator,(std::ostream& o, const T& value) {
    o << value;
    return o;
}

#define print std::cout,

void main()
{
    print "This is Python (almost). ", 13, " ", 42.0, "\n";
}


(edit: в комментах еще более питонистые варианты!)

Обсуждение этого сообщения (3)



Редактировал Fj_ (31.08.2011 14:44)
vissi   [re:nafig_batat]   31.08.2011 16:14    | Reply | Edit |
0
Сообщение удалил vissi ( баян )

Обсуждение этого сообщения (1)



Редактировал vissi (31.08.2011 16:43)
Fj_   [re:Fj_]   06.09.2011 14:04    | Reply | Edit |
3
Чувак анализирует сурцы ReactOS своим статическим анализатором PVS Studio. Количество и качество ошибок постепенно подтачивает его способность сохранять профессиональный, отстраненный тон.


I will only cite the following piece of code for dessert:
code:
#define SWAP(a,b,c) c = a;\ a = b;\ a = c

An example of how it was used:
code:
BOOL FASTCALL IntEngGradientFillTriangle(...) { ... SWAP(v2,v3,t); ... }

This is a masterpiece.


Обсуждение этого сообщения (4)

blind   [re:Fj_]   09.09.2011 15:06    | Reply | Edit |
-3
/user/upload/file423379.jpg (819 Kb)

Обсуждение этого сообщения (5)

Fj_   [re:blind]   09.09.2011 16:51    | Reply | Edit |
15
Here's my self-replicating Python script. I call it "fail.py".

  File "fail.py", line 1
    File "fail.py", line 1
    ^
IndentationError: unexpected indent


(from http://www.reddit.com/r/Python/comments/k9857/xx010_print_xf...)

Обсуждение этого сообщения (2)

Druxa   [re:Fj_]   15.09.2011 01:05    | Reply | Edit |
11
http://www.youtube.com/v/AEPvSo8bE2I
Ролик явно про программирование! В одном месте делаешь фокусы и магию, а в это время где-то рядом... :grin:

Начать обсуждение

alcogolic   [re:nafig_batat]   20.09.2011 19:35    | Reply | Edit |
-1
/user/upload/file424718.jpg

 (c) http://sem-lj.livejournal.com/127588.html?style=mine

Обсуждение этого сообщения (1)

kranoman   [re:alcogolic]   27.09.2011 11:27    | Reply | Edit |
8
Возможно боян, но здесь еще не видел...

Вставками:
http://www.youtube.com/v/ROalU379l3U

Bubble-sort:
http://www.youtube.com/v/lyZQPjUT5B4

Quick-sort:
http://www.youtube.com/v/ywWBy6J5gz8

и так далее...


Обсуждение этого сообщения (6)

Sevurrrra   [re:kranoman]   03.10.2011 13:52    | Reply | Edit |
12
bool FirstRun::SearchEngineSelectorDisallowed() {
// For now, the only case in which the search engine dialog should never be
// shown is if the locale is Russia.
std::string locale = g_browser_process->GetApplicationLocale();
return (locale == "ru");
}

src.chromium.org/viewvc/chrome/trunk/src/chrome/browser/first_run/first_run.cc?r1=84235&r2=84234&pathrev=84235
Гугл уверяет, что это появилось 'случайно'. А акции яндекса упали на 13%.

Обсуждение этого сообщения (3)

unkulunkulu   [re:Sevurrrra]   04.10.2011 16:38    | Reply | Edit |
13
'Первое правило бойцовского клуба':

code:
% gdb (gdb) help obscure Obscure features. List of commands: checkpoint -- Fork a duplicate process (experimental) <some lines omitted> stop -- There is no `stop' command


Начать обсуждение

DeeMon   [re:unkulunkulu]   07.10.2011 20:18    | Reply | Edit |
5
http://www.youtube.com/v/b-Cr0EWwaTk

Обсуждение этого сообщения (3)

Fj_   [re:DeeMon]   10.10.2011 16:17    | Reply | Edit |
2
http://download.oracle.com/docs/cd/E13203_01/tuxedo/tux71/ht...

Note the use of the variable, cursor, to indicate a successful match as well as to provide (on success) the starting point for the next search. A less courageous programmer would check recomp()'s return value and restrict the length of the pattern match to the receiving buffer's size (for example, "{0,98}" instead of "*").

Начать обсуждение

vissi   [re:Fj_]   11.10.2011 13:53    | Reply | Edit |
12
Давно хотел раскрыть тему
/user/upload/file427303.jpg

Начать обсуждение

ayvango   [re:vissi]   13.10.2011 15:00    | Reply | Edit |
10
Вся современная асимметричная криптография в настоящее время основывается на двух простых и понятных принципах: вера и надежда. Вера в то, что при выполнении условия P≠NP, криптосистема не взламываема за полиномиальное время. Надежда, что квантовый компьютер так же далек от нас как созведие Кассиопеи.


Обсуждение этого сообщения (2)

DeeMon   [re:ayvango]   14.10.2011 10:18    | Reply | Edit |
5
Изобретаешь или пропагандируешь новый язык программирования? Он не взлетит, и вот почему (расставить галочки самостоятельно):
 
code:
You appear to be advocating a new: [ ] functional [ ] imperative [ ] object-oriented [ ] procedural [ ] stack-based [ ] "multi-paradigm" [ ] lazy [ ] eager [ ] statically-typed [ ] dynamically-typed [ ] pure [ ] impure [ ] non-hygienic [ ] visual [ ] beginner-friendly [ ] non-programmer-friendly [ ] completely incomprehensible programming language. Your language will not work. Here is why it will not work. You appear to believe that: [ ] Syntax is what makes programming difficult [ ] Garbage collection is free [ ] Computers have infinite memory [ ] Nobody really needs: [ ] concurrency [ ] a REPL [ ] debugger support [ ] IDE support [ ] I/O [ ] to interact with code not written in your language [ ] The entire world speaks 7-bit ASCII [ ] Scaling up to large software projects will be easy [ ] Convincing programmers to adopt a new language will be easy [ ] Convincing programmers to adopt a language-specific IDE will be easy [ ] Programmers love writing lots of boilerplate [ ] Specifying behaviors as "undefined" means that programmers won't rely on them [ ] "Spooky action at a distance" makes programming more fun Unfortunately, your language (has/lacks): [ ] comprehensible syntax [ ] semicolons [ ] significant whitespace [ ] macros [ ] implicit type conversion [ ] explicit casting [ ] type inference [ ] goto [ ] exceptions [ ] closures [ ] tail recursion [ ] coroutines [ ] reflection [ ] subtyping [ ] multiple inheritance [ ] operator overloading [ ] algebraic datatypes [ ] recursive types [ ] polymorphic types [ ] covariant array typing [ ] monads [ ] dependent types [ ] infix operators [ ] nested comments [ ] multi-line strings [ ] regexes [ ] call-by-value [ ] call-by-name [ ] call-by-reference [ ] call-cc The following philosophical objections apply: [ ] Programmers should not need to understand category theory to write "Hello, World!" [ ] Programmers should not develop RSI from writing "Hello, World!" [ ] The most significant program written in your language is its own compiler [ ] The most significant program written in your language isn't even its own compiler [ ] No language spec [ ] "The implementation is the spec" [ ] The implementation is closed-source [ ] covered by patents [ ] not owned by you [ ] Your type system is unsound [ ] Your language cannot be unambiguously parsed [ ] a proof of same is attached [ ] invoking this proof crashes the compiler [ ] The name of your language makes it impossible to find on Google [ ] Interpreted languages will never be as fast as C [ ] Compiled languages will never be "extensible" [ ] Writing a compiler that understands English is AI-complete [ ] Your language relies on an optimization which has never been shown possible [ ] There are less than 100 programmers on Earth smart enough to use your language [ ] ____________________________ takes exponential time [ ] ____________________________ is known to be undecidable Your implementation has the following flaws: [ ] CPUs do not work that way [ ] RAM does not work that way [ ] VMs do not work that way [ ] Compilers do not work that way [ ] Compilers cannot work that way [ ] Shift-reduce conflicts in parsing seem to be resolved using rand() [ ] You require the compiler to be present at runtime [ ] You require the language runtime to be present at compile-time [ ] Your compiler errors are completely inscrutable [ ] Dangerous behavior is only a warning [ ] The compiler crashes if you look at it funny [ ] The VM crashes if you look at it funny [ ] You don't seem to understand basic optimization techniques [ ] You don't seem to understand basic systems programming [ ] You don't seem to understand pointers [ ] You don't seem to understand functions Additionally, your marketing has the following problems: [ ] Unsupported claims of increased productivity [ ] Unsupported claims of greater "ease of use" [ ] Obviously rigged benchmarks [ ] Graphics, simulation, or crypto benchmarks where your code just calls handwritten assembly through your FFI [ ] String-processing benchmarks where you just call PCRE [ ] Matrix-math benchmarks where you just call BLAS [ ] Noone really believes that your language is faster than: [ ] assembly [ ] C [ ] FORTRAN [ ] Java [ ] Ruby [ ] Prolog [ ] Rejection of orthodox programming-language theory without justification [ ] Rejection of orthodox systems programming without justification [ ] Rejection of orthodox algorithmic theory without justification [ ] Rejection of basic computer science without justification Taking the wider ecosystem into account, I would like to note that: [ ] Your complex sample code would be one line in: _______________________ [ ] We already have an unsafe imperative language [ ] We already have a safe imperative OO language [ ] We already have a safe statically-typed eager functional language [ ] You have reinvented Lisp but worse [ ] You have reinvented Javascript but worse [ ] You have reinvented Java but worse [ ] You have reinvented C++ but worse [ ] You have reinvented PHP but worse [ ] You have reinvented PHP better, but that's still no justification [ ] You have reinvented Brainfuck but non-ironically In conclusion, this is what I think of you: [ ] You have some interesting ideas, but this won't fly. [ ] This is a bad language, and you should feel bad for inventing it. [ ] Programming in this language is an adequate punishment for inventing it.

http://colinm.org/language_checklist.html

Начать обсуждение

Top | след. страница