- 1
- 2
- 3
- 4
if ( !empty($vendor) and strtolower(substr($record_title, 0, strlen($vendor)+1)) == strtolower("$vendor ")
) {
$record_title = substr($record_title, strlen($vendor)+1);
}
Нашли или выдавили из себя код, который нельзя назвать нормальным, на который без улыбки не взглянешь? Не торопитесь его удалять или рефакторить, — запостите его на говнокод.ру, посмеёмся вместе!
+157
if ( !empty($vendor) and strtolower(substr($record_title, 0, strlen($vendor)+1)) == strtolower("$vendor ")
) {
$record_title = substr($record_title, strlen($vendor)+1);
}
Вырзаем из названия товара, компанию производителя.
+156
$masterContacts = $masterClient->getContacts();
for ($i=0; $i < count($masterContacts); $i++) {
for ($j=$i+1; $j < count($masterContacts); $j++) {
if(!(strcmp($masterContacts[$i]->getFirstName(), $masterContacts[$j]->getFirstName()) && strcmp($masterContacts[$i]->getLastName(), $masterContacts[$j]->getLastName()))){
echo $masterContacts[$i]->getFirstName() . ", " . $masterContacts[$i]->getLastName() . "==" . $masterContacts[$i]->getFirstName() . ", " . $masterContacts[$i]->getLastName() . "\n";
foreach ($masterContacts[$i]->getFields() as $contact_i) {
$contact_i->setContact($masterContacts[$j]);
// $masterContacts[$i]->removeField($contact_i);
// $masterContacts[$j]->addField($contact_i);
}
$em->remove($masterContacts[$i]);
// $masterClient->removeContact($masterContacts[$i]);
break;
}
}
}
foreach ($masterContacts as $masterContact) {
for ($i=0; $i < count($masterContact->getFields()); $i++) {
$field_i = $masterContact->getFields()[$i];
foreach ($masterContacts as $masterContact) {
for ($j=$i+1; $j < count($masterContact->getFields()); $j++) {
$field_j = $masterContact->getFields()[$j];
// if(!strcmp($masterContact->getFields()[$i]->getInn(), $masterContact->getFields()[$j]->getInn())){
if(!strcmp($field_i->getXValue(), $field_j->getXValue())) {
// echo "compare :" . $field_i->getXValue() . " == " . $field_j->getXValue();
$em->remove($field_i);
break;
}
}
}
}
}
// echo $masterClient->getId();
$mOrganizations = $masterClient->getOrganization();
for ($i=0; $i < count($mOrganizations); $i++) {
for ($j=$i+1; $j < count($mOrganizations); $j++) {
if(!strcmp($mOrganizations[$i]->getInn(), $mOrganizations[$j]->getInn())){
echo "compare :" . $mOrganizations[$i]->getInn() . " == " . $mOrganizations[$j]->getInn();
$em->remove($mOrganizations[$i]);
break;
}
}
}
+133
lc = $(subst A,a,$(subst B,b,$(subst C,c,$(subst D,d,$(subst E,e,$(subst F,f,$(subst G,g,$(subst H,h,$(subst I,i,$(subst J,j,$(subst K,k,$(subst L,l,$(subst M,m,$(subst N,n,$(subst O,o,$(subst P,p,$(subst Q,q,$(subst R,r,$(subst S,s,$(subst T,t,$(subst U,u,$(subst V,v,$(subst W,w,$(subst X,x,$(subst Y,y,$(subst Z,z,$1))))))))))))))))))))))))))
VAR = MixedCaseText
LOWER_VAR = $(call lc,$(VAR))
all:
@echo $(VAR)
@echo $(LOWER_VAR)
как реализовать портабельно lowercase функцию в GNU Make.
как же я тебя временами лублу, мэйк.
ЗЫ было случайно найдено в http://stackoverflow.com/questions/664601/in-gnu-make-how-do-i-convert-a-variable-to-lower-case
+88
program One;
var
a, b, c: integer;
begin
assign(input, 'input.txt'); reset(input);
assign(output, 'output.txt'); rewrite(output);
read(a);
if a = 5 then
Writeln('25')
else if (a div 5 = 1)
then
Writeln('Введите число, оканчивающееся на 5!')
else begin
b := a div 10;
c := b * (b + 1);
Writeln(c, '25');
end;
end.
+160
mysql_query('select UNIX_TIMESTAMP(DATE_FORMAT(FROM_UNIXTIME(UNIX_TIMESTAMP(Event.Time) - DATE_FORMAT(Event.Time,"%w") * 60 * 60 * 24), "%Y-%m-%d 00:00:00")) as GroupDate from ...');
// и контрольный:
$dateFormated = strftime($format, $GroupDate);
// расшифровка (SPOILER):
// автор пытался найти воскресенье предшествующее дате из Event.Time
// и вывести его в формате YYYY-MM-DD
нашел в процессе code review
+162
function makeRequest(params)
{
var tParams = new Object();
try{
tParams.accepts = params.accepts
}
catch(e){}
try{
tParams.async = params.async
}
catch(e){}
try{
tParams.beforeSend = params.beforeSend
}
catch(e){}
try{
tParams.cache = params.cache
}
catch(e){}
очередной тревел-стартап
http://www.corteos.ru/Scripts/helpers.js
+74
// TODO: This is not the smartest way to implement the config
public int getFileFragmentationLevel() {
return config.getFileFragmentationLevel();
}
public void setFileFragmentationLevel(int fileFragmentationLevel) {
config.setFileFragmentationLevel(fileFragmentationLevel);
}
public int getStackTraceOutputMethod() {
return config.getStackTraceOutputMethod();
}
public void setStackTraceOutputMethod(int stackTraceOutputMethod) {
config.setStackTraceOutputMethod(stackTraceOutputMethod);
}
public String getOutputDirectory() {
return config.getOutputDirectory();
}
public void setOutputDirectory(String outputDirectory) {
config.setOutputDirectory(outputDirectory);
}
// и так для всех филдов (геттеров/сеттеров) объекта config
https://github.com/cbeust/testng/blob/master/src/main/java/org/testng/reporters/XMLReporter.java
Ну хоть признаёт.
+57
for (j=0;j<3;j++) {
tmp += member[i].V[2][j] * member[i].V[0][j];}
if (tmp > LENGTH_EPS) {
if ( node[member[i].n0].u_fix.y == 0 ) { //if node #1 is not fixed
if ( node[member[i].n0].teta_fix.x == 0 ) { //if node #3 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+1, FreeDeg*n_number[member[i].n0] +3, 6*EJz/member[i].L*tmp );} //k(1,3)
if ( node[member[i].n1].teta_fix.x == 0 ) { //if node #9 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+1, FreeDeg*n_number[member[i].n1] +3, 6*EJz/member[i].L*tmp );} //k(1,9)
}
if ( node[member[i].n0].u_fix.z == 0 ) { //if node #2 is not fixed
if ( node[member[i].n0].u_fix.x == 0 ) { //if node #0 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+2, FreeDeg*n_number[member[i].n0], 12*EJy/pow(member[i].L,2)*tmp );} //k(2,0)
if ( node[member[i].n1].u_fix.x == 0 ) { //if node #6 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+2, FreeDeg*n_number[member[i].n1], -12*EJy/pow(member[i].L,2)*tmp );} //k(2,6)
}
if ( node[member[i].n0].teta_fix.y == 0 ) { //if node #4 is not fixed
if ( node[member[i].n0].u_fix.x == 0 ) { //if node #0 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+4, FreeDeg*n_number[member[i].n0], -6*EJy/member[i].L*tmp );} //k(4,0)
if ( node[member[i].n1].u_fix.x == 0 ) { //if node #6 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+4, FreeDeg*n_number[member[i].n1], 6*EJy/member[i].L*tmp );} //k(4,6)
}
if ( node[member[i].n0].teta_fix.z == 0 ) { //if node #5 is not fixed
if ( node[member[i].n0].teta_fix.x == 0 ) { //if node #3 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+5, FreeDeg*n_number[member[i].n0] +3, 4*EJz*tmp );} //k(5,3)
if ( node[member[i].n1].teta_fix.x == 0 ) { //if node #9 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+5, FreeDeg*n_number[member[i].n1] +3, 2*EJz/member[i].L*tmp );} //k(5,9)
}
if ( node[member[i].n1].u_fix.y == 0) { //if node #7 is not fixed
if ( node[member[i].n0].teta_fix.x == 0 ) { //if node #3 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+1, FreeDeg*n_number[member[i].n0] +3, -6*EJz/member[i].L*tmp );} //k(7,3)
if ( node[member[i].n1].teta_fix.x == 0 ) { //if node #9 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+1, FreeDeg*n_number[member[i].n1] +3, -6*EJz/member[i].L*tmp );} //k(7,9)
}
if ( node[member[i].n1].u_fix.z == 0 ) { //if node #8 is not fixed
if ( node[member[i].n0].u_fix.x == 0 ) { //if node #0 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+2, FreeDeg*n_number[member[i].n0], -12*EJy/pow(member[i].L,2)*tmp );} //k(8,0)
if ( node[member[i].n1].u_fix.x == 0 ) { //if node #6 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+2, FreeDeg*n_number[member[i].n1], 12*EJy/pow(member[i].L,2)*tmp );} //k(8,6)
}
if ( node[member[i].n1].teta_fix.y == 0 ) { //if node #10 is not fixed
if ( node[member[i].n0].u_fix.x == 0 ) { //if node #0 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+4, FreeDeg*n_number[member[i].n0], -6*EJy/member[i].L*tmp );} //k(10,0)
if ( node[member[i].n1].u_fix.x == 0 ) { //if node #6 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+4, FreeDeg*n_number[member[i].n1], 6*EJy/member[i].L*tmp );} //k(10,6)
}
if ( node[member[i].n1].teta_fix.z == 0 ) { //if node #11 is not fixed
if ( node[member[i].n0].teta_fix.x == 0 ) { //if node #3 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+5, FreeDeg*n_number[member[i].n0] +3, 2*EJz*tmp );} //k(11,3)
if ( node[member[i].n1].teta_fix.x == 0 ) { //if node #9 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+5, FreeDeg*n_number[member[i].n1] +3, 4*EJz*tmp );} //k(11,9)
}
}
//SUM(Lzi * Lyi), i=x0,y0,z0
tmp = 0;
for (j=0;j<3;j++) {
tmp += member[i].V[2][j] * member[i].V[1][j];}
if (tmp > LENGTH_EPS) {
if ( node[member[i].n0].u_fix.y == 0 ) { //if node #1 is not fixed
if ( node[member[i].n0].teta_fix.y == 0 ) { //if node #4 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+1, FreeDeg*n_number[member[i].n0] +4, 6*EJz/member[i].L*tmp ); //k(1,4)
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+4, FreeDeg*n_number[member[i].n0] +1, -6*EJy/member[i].L*tmp ); //k(4,1)
}
if ( node[member[i].n1].teta_fix.y == 0 ) { //if node #10 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+1, FreeDeg*n_number[member[i].n1] +4, 6*EJz/member[i].L*tmp ); //k(1,10)
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+4, FreeDeg*n_number[member[i].n0] +1, -6*EJy/member[i].L*tmp ); //k(10,1)
}
}
if ( node[member[i].n1].u_fix.y == 0) { //if node #7 is not fixed
if ( node[member[i].n0].teta_fix.y == 0 ) { //if node #4 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n0]+4, FreeDeg*n_number[member[i].n1] +1, 6*EJy/member[i].L*tmp ); //k(4,7)
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+1, FreeDeg*n_number[member[i].n0] +4, -6*EJz/member[i].L*tmp ); //k(7,4)
}
if ( node[member[i].n1].teta_fix.y == 0 ) { //if node #10 is not fixed
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+1, FreeDeg*n_number[member[i].n1] +4, -6*EJz/member[i].L*tmp ); //k(7,10)
k_var.AddNewElement( FreeDeg*n_number[member[i].n1]+4, FreeDeg*n_number[member[i].n1] +1, 6*EJy/member[i].L*tmp ); //k(10,7)
}
}
..............................еще 10 страниц
математики... бессмысленные и беспощадные.
+138
public static byte[] Trim(this byte[] origin_array)
{
int findex = -1, eindex = -1;
bool inseq = false;
if (origin_array[0] != 0x00)
{
if (origin_array[origin_array.Length - 1] != 0x00)
return origin_array;
findex = 0;
}
for (int i = 0; i < origin_array.Length; i++)
{
if (origin_array[i] == 0x00)
{
if (inseq)
continue;
else
inseq = true;
}
else
{
if (inseq)
if (findex == -1)
findex = i;
eindex = i;
}
}
if (findex == eindex)
return new byte[0];
byte[] result_array = new byte[eindex - findex + 1];
Array.Copy(origin_array, findex, result_array, 0, result_array.Length);
return result_array;
}
+157
// экшен произвольного контроллера, они там все такие
$data['heading_title'] = $this->language->get('heading_title');
$data['text_my_account'] = $this->language->get('text_my_account');
$data['text_my_orders'] = $this->language->get('text_my_orders');
$data['text_my_newsletter'] = $this->language->get('text_my_newsletter');
$data['text_edit'] = $this->language->get('text_edit');
$data['text_password'] = $this->language->get('text_password');
// еще 20-30 аналогичных строчек
$data['column_left'] = $this->load->controller('common/column_left');
$data['column_right'] = $this->load->controller('common/column_right');
$data['content_top'] = $this->load->controller('common/content_top');
$data['content_bottom'] = $this->load->controller('common/content_bottom');
$data['footer'] = $this->load->controller('common/footer');
$data['header'] = $this->load->controller('common/header');
if (file_exists(DIR_TEMPLATE . $this->config->get('config_template') . '/template/account/account.tpl')) {
$this->response->setOutput($this->load->view($this->config->get('config_template') . '/template/account/account.tpl', $data));
} else {
$this->response->setOutput($this->load->view('default/template/account/account.tpl', $data));
}
теги: Опенкарт, вчера релизнули, модный паттерн MVC-L, тонкие контроллеры, классика, табы для того и сделаны, чтобы ими отбивать
https://github.com/opencart/opencart/tree/master/upload/catalog/controller/account