- 1
list(zip_longest(*[iter(('0'+str(bin(int(time.time())))[2:]).replace('0', '_').replace('1', '*'))]*4))
Нашли или выдавили из себя код, который нельзя назвать нормальным, на который без улыбки не взглянешь? Не торопитесь его удалять или рефакторить, — запостите его на говнокод.ру, посмеёмся вместе!
−94
list(zip_longest(*[iter(('0'+str(bin(int(time.time())))[2:]).replace('0', '_').replace('1', '*'))]*4))
увидел у в скрипте на подобии archey3
+162
function dotsOrder($dots)
{
if($dots>=4){
return 18;
} else if($dots>=3 && $dots<4){
return 17;
} else if($dots>=2 && $dots<3){
return 16;
} else if($dots>=1 && $dots<2){
return 14;
} else if($dots>=0 && $dots<1){
return 12;
} else {
return 10;
}
}
+155
this.resize = function(d) {
var curSize, newSize;
if (DOM && settings.resiziable === true) {
curSize = $(DOM).height();
if (d < 0) {
if (settings.min) {
if (curSize + d < settings.min) {
newSize = settings.min;
} else {
newSize = curSize + d;
}
} else {
newSize = curSize + d;
}
} else {
if (settings.max) {
if (curSize + d > settings.max) {
newSize = settings.max;
} else {
newSize = curSize + d;
}
} else {
newSize = curSize + d;
}
}
if (newSize !== curSize) {
$(DOM).height(newSize);
}
}
};
Что-то меня корёжит немного от этого метода.
+133
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <unistd.h>
void my_char_plus(const void *a, const void *b, void *c)
{
char tmp = (*(char*)a + *(char*)b);
memcpy(c,(void*)(&tmp),sizeof(char));
}
void my_char_minus(const void *a, const void *b, void *c)
{
char tmp = (*(char*)a - *(char*)b);
memcpy(c,(void*)(&tmp),sizeof(char));
}
void operation(const void *funct(const void*,const void*,void*),
const void *a, const void *b, void *c )
{
funct(a,b,c);
}
char ret_last_arg(const void *funct(const void*,const void*,void*),
const void *a, const void *b)
{
char c;
funct(a,b,(void*)&c);
return c;
}
int main(void)
{
char a, b;
a = 5; b = 7;
void *plus = &my_char_plus; char c;
operation(plus, (const void*)&a, (const void*)&b, (void*)&c);
printf("5 + 7 = %i\n", c);
void *minus = &my_char_minus;
char d = ret_last_arg(minus, (const void*)&a, (const void*)&b);
printf("5 - 7 = %i\n", d);
// LISP LISP LISP
#define LISP(ar,aa,bb) ret_last_arg(ar, (const void*)&(char){aa}, (const void*)&(char){bb} )
char e = LISP(plus,2,LISP(plus,2,2));
printf("(+ 2 (+ 2 2 ) ) = %i\n", e);
return 0;
}
Лиспопрограммирование на сишке через макрос (префиксная запись)
Только оно кривовато тут, т.е. получаем трехадресный код (не как в лиспе)
http://masters.donntu.edu.ua/2006/fvti/svyezhentsev/library/article2.htm
Можно делать интерпретаторы фигни всякой, шитый код. Я упорот короче
−125
if [ $count > 0 ]; then
...
fi
+155
switch ( count($args) )
{
case 0:
return $obj->$method( );
case 1:
return $obj->$method( $args[0] );
case 2:
return $obj->$method( $args[0], $args[1] );
case 3:
return $obj->$method( $args[0], $args[1], $args[2] );
case 4:
return $obj->$method( $args[0], $args[1], $args[2], $args[3] );
case 5:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4] );
case 6:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5] );
case 7:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5], $args[6] );
case 8:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5], $args[6], $args[7] );
case 9:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5], $args[6], $args[7], $args[8] );
case 10:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5], $args[6], $args[7], $args[8], $args[9] );
case 11:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5], $args[6], $args[7], $args[8], $args[9], $args[10] );
case 12:
return $obj->$method( $args[0], $args[1], $args[2], $args[3], $args[4], $args[5], $args[6], $args[7], $args[8], $args[9], $args[10], $args[11] );
}
throw new MWException( __CLASS__.": too many arguments to method called in ".__METHOD__ );
+68
boolean isCyrillic(char c) {
return Character.UnicodeBlock.CYRILLIC.equals(Character.UnicodeBlock.of(c));
}
Краткость - сестра таланта
+46
//В хедере
QVector<double> stateStack;
//Сохраняем
stateStack.push_back((double)renderInclusionsAs3DMeshSpheres);
stateStack.push_back((double)transparencyForClosestSidePolies);
stateStack.push_back((double)renderFEMGrid);
stateStack.push_back((double)NEST_results_detail_per_unit);
stateStack.push_back((double)sourceLineActive);
stateStack.push_back((double)renderScale);
stateStack.push_back((double)c2DZoom1To1);
stateStack.push_back((double)render2DInclusions);
stateStack.push_back((double)render3DInclusions);
stateStack.push_back((double)renderNESTResults);
stateStack.push_back((double)renderFEAResults);
stateStack.push_back((double)NEST_anumTime);
stateStack.push_back((double)isAnimRun);
stateStack.push_back((double)NEST_timeIterToRender);
stateStack.push_back((double)NEST_RenderResultsIn3D);
stateStack.push_back((double)NEST_renderTestPoints);
stateStack.push_back((double)nestNewResults);
stateStack.push_back((double)fibers_renderFormedRegions);
stateStack.push_back((double)sourceLineStarted);
stateStack.push_back((double)renderSourceLine);
stateStack.push_back((double)heatQuadsModifyMode);
stateStack.push_back((double)renderTopHeats);
stateStack.push_back((double)sliceModifyMode);
stateStack.push_back((double)useSlicePlane);
stateStack.push_back((double)showSlicedPart);
stateStack.push_back((double)cRenderMenuOpended);
stateStack.push_back((double)cForbidRenderResultsOverLayers);
stateStack.push_back((double)renderCoordLines);
stateStack.push_back((double)renderDimensions);
stateStack.push_back((double)renderLimits);
stateStack.push_back((double)cResTransparency);
stateStack.push_back((double)cRenderResultsOverLayers);
stateStack.push_back((double)cActiveLayer);
stateStack.push_back((double)renderMiniMapAtTop);
stateStack.push_back((double)subCompositeMode);
stateStack.push_back((double)subCompositeMapRendering);
stateStack.push_back((double)fibersRenderable);
stateStack.push_back((double)renderFibersAsMesh);
stateStack.push_back((double)droplets_detailedSpheres);
stateStack.push_back((double)cViewType);
//Загружаем
renderInclusionsAs3DMeshSpheres =(bool)stateStack[0];
transparencyForClosestSidePolies= stateStack[1];
renderFEMGrid=(bool) stateStack[2];
NEST_results_detail_per_unit= stateStack[3];
sourceLineActive=(bool) stateStack[4];
renderScale=(bool) stateStack[5];
c2DZoom1To1=(bool) stateStack[6];
render2DInclusions=(bool) stateStack[7];
render3DInclusions=(bool) stateStack[8];
renderNESTResults=(bool) stateStack[9];
renderFEAResults=(bool) stateStack[10];
NEST_anumTime= stateStack[11];
isAnimRun=(bool) stateStack[12];
NEST_timeIterToRender= stateStack[13];
NEST_RenderResultsIn3D=(bool) stateStack[14];
NEST_renderTestPoints=(bool) stateStack[15];
nestNewResults=(bool) stateStack[16];
fibers_renderFormedRegions=(bool) stateStack[17];
sourceLineStarted=(bool) stateStack[18];
renderSourceLine=(bool) stateStack[19];
heatQuadsModifyMode=(bool) stateStack[20];
renderTopHeats=(bool) stateStack[21];
sliceModifyMode=(bool) stateStack[22];
useSlicePlane=(bool) stateStack[23];
showSlicedPart=(bool) stateStack[24];
cRenderMenuOpended=(bool) stateStack[25];
cForbidRenderResultsOverLayers=(bool) stateStack[26];
renderCoordLines= stateStack[27];
renderDimensions=(bool) stateStack[28];
renderLimits= stateStack[29];
cResTransparency= stateStack[30];
cRenderResultsOverLayers=(bool) stateStack[31];
cActiveLayer= stateStack[32];
renderMiniMapAtTop =(bool) stateStack[33];
subCompositeMode =(bool) stateStack[34];
subCompositeMapRendering =(bool) stateStack[35];
fibersRenderable=(bool) stateStack[36];
renderFibersAsMesh=(bool) stateStack[37];
droplets_detailedSpheres= stateStack[38];
cViewType= stateStack[39];
Структуры для педиков.
+137
#define SPLICE(a,b) SPLICE_1(a,b)
#define SPLICE_1(a,b) SPLICE_2(a,b)
#define SPLICE_2(a,b) a##b
#define PP_ARG_N( \
_1, _2, _3, _4, _5, _6, _7, _8, _9, _10, \
_11, _12, _13, _14, _15, _16, _17, _18, _19, _20, \
_21, _22, _23, _24, _25, _26, _27, _28, _29, _30, \
_31, _32, _33, _34, _35, _36, _37, _38, _39, _40, \
_41, _42, _43, _44, _45, _46, _47, _48, _49, _50, \
_51, _52, _53, _54, _55, _56, _57, _58, _59, _60, \
_61, _62, _63, N, ...) N
/* Note 63 is removed */
#define PP_RSEQ_N() \
62, 61, 60, \
59, 58, 57, 56, 55, 54, 53, 52, 51, 50, \
49, 48, 47, 46, 45, 44, 43, 42, 41, 40, \
39, 38, 37, 36, 35, 34, 33, 32, 31, 30, \
29, 28, 27, 26, 25, 24, 23, 22, 21, 20, \
19, 18, 17, 16, 15, 14, 13, 12, 11, 10, \
9, 8, 7, 6, 5, 4, 3, 2, 1, 0
#define PP_NARG_(...) PP_ARG_N(__VA_ARGS__)
/* Note dummy first argument _ and ##__VA_ARGS__ instead of __VA_ARGS__ */
#define PP_NARG(...) PP_NARG_(_, ##__VA_ARGS__, PP_RSEQ_N())
#define NARG(...) func(PP_NARG(__VA_ARGS__), __VA_ARGS__)
#define INCR 20
#define FIELD_0(...)
#define FIELD_1(field, ...) \
INCR+field
#define FIELD_2(field, ...) \
INCR+field, FIELD_1(__VA_ARGS__)
#define FIELD_3(field, ...) \
INCR+field, FIELD_2(__VA_ARGS__)
#define FIELD_4(field, ...) \
INCR+field, FIELD_3(__VA_ARGS__)
#define FIELD_5(field, ...) \
INCR+field, FIELD_4(__VA_ARGS__)
#define FIELD_5(field, ...) \
INCR+field, FIELD_4(__VA_ARGS__)
#define FIELD_6(field, ...) \
INCR+field, FIELD_5(__VA_ARGS__)
#define FIELD_7(field, ...) \
INCR+field, FIELD_6(__VA_ARGS__)
#define FIELD_8(field, ...) \
INCR+field, FIELD_7(__VA_ARGS__)
#define FIELD_9(field, ...) \
INCR+field, FIELD_8(__VA_ARGS__)
#define FIELD_10(field, ...) \
INCR+field, FIELD_9(__VA_ARGS__)
#define FIELD_11(field, ...) \
INCR+field, FIELD_10(__VA_ARGS__)
//..... дальше лень ...
#define FIELDS_(N, ...) \
SPLICE(FIELD_, N)(__VA_ARGS__)
#define FIELDS(...) \
FIELDS_(PP_NARG(__VA_ARGS__), __VA_ARGS__)
a = { FIELDS('p', 'a', 's', 's', 'w', 'o', 'r', 'd') }
Примитивное компил-тайм шифрование строки через сишный препроцессор. На выходе получаем
a = { 20 +'p', 20 +'a', 20 +'s', 20 +'s', 20 +'w', 20 +'o', 20 +'r', 20 +'d' };+154
function login()
{
$.ajax({
type:'post',
url:'index.php/main/login',
data:{x:1},
success:function(data){
$("body").html(data);
}
});
}
Функция из single page приложения