mysql - php function with with multiple queries - inner join duplicating results? -


i have been tackling trying incorporate , implement shopping cart system.

how make display 1 add cart button each shop product listing correct price showing?

i have function in functions file. , function has 2 queries in it.

first table called: products

    $results = $db->query("select distinct * `products` inner join `shop` on `products`.`id` = `shop`.`id`;");     $paypalcontent = "";     while($row = $results->fetch_assoc())         {

second table called: shop 

    $results = $db->query("select distinct * shop ");     while($row = $results->fetch_assoc())     {

i use 

unset($results); unset($row);

to unset results second query can queried.

so results resulting in repeating add cart buttons rows in products table. show picture.

enter image description here

so table info: shop table has info in it, 18 rows pictures , links , descriptions etc etc.

structure:

 table 1 - products: id, name, image, price, status   table 2 - shop: id,title, name, standardprice, commercialprice, image, image2, image3, image4, image5, image6, description, descr, more, moredetails, url, paypalstandard, paypalcommercial

i removing paypalstandard , paypalcommercial once got working. standardprice , commercial price other pages.

second table products creates buttons paypal end in form.

so have row standard , commercial in each table, products , shop. need display correct add cart button each shop listing - 1 button each listing. needing linked product creates correct button , price each shop product.

edit: need show 1 button per shop item. see in picture above shows 4 buttons. need show 1 each correct price reflected in each product.

further edit: 2 tables both have id , both primary keys. have tried many different queries left , right join no avail.

thanks

well first start i'd recommend use js making temporary cart front end. after build data , send int json or whatever , update using needed items, dont reserve or inner because not needed. wait xhr or whatever php post data , update data dont use inner because not needed @ all.


Comments

Post a Comment

Popular posts from this blog

Sort a complex associative array in PHP -

this question has answer here: php sort array subarray value 5 answers i have associative array in php like: $newarray1 = array ( [producta] => array ( [link] => http://sanjosespartan.com/blog/products/agile-java-development/ [visitcount] => 4 ) [productd] => array ( [link] => http://sanjosespartan.com/blog/products/intro-to-go/ [visitcount] => 1 ) [productg] => array ( [link] => http://sanjosespartan.com/blog/products/node-js-for-developers/ [visitcount] => 1 ) [productb] => array ( [link] => http://sanjosespartan.com/blog/products/beginning-mysql/ [visitcount] => 1 ) [productc] => array ( [link] => http://sanjosespartan.com/blog/products/computer-networks/ [visitcount] => 1 ) ...
Read more

vb.net - How to ignore if a cell is empty nothing -

how use roscolor() ignore value (like empty cell) ? color row if value upper 5 when there nothing in cell, want ignore roscolor() apply, how? public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val integer val = quotedatagridview1.rows(i).cells(3).value if val = vbempty quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white elseif val < 5 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.red elseif val > 5 , val < 10 quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.lightyellow end if next end sub you can check empty value following public sub roscolor() integer = 0 quotedatagridview1.rows.count() - 1 step +1 dim val = quotedatagridview1.rows(i).cells(3).value if isdbnull(val) or val nothing quotedatagridview1.rows(i).defaultcellstyle.backcolor = color.white ...
Read more

recursion - Can every recursive algorithm be improved with dynamic programming? -

i first year undergraduate csc student looking competitive programming. recursion involves defining , solving sub problems. understand, top down dynamic programming (dp) involves memoizing solutions sub problems reduce time complexity of algorithm. can top down dp used improve efficiency of every recursive algorithm overlapping sub problems? dp fail work , how can identify this? the short answer is: yes. however, there constraints. obvious 1 recursive calls must overlap. i.e. during execution of algorithm, recursive function must called multiple times same parameters. lets truncate recursion tree memoization. can use memoization reduce number of calls. however, reduction of calls comes price. need store results somewhere. next obvious constraint need have enough memory. comes not-so obvious constraint. memory access requires time. first need find result stored , maybe copy location. in cases, might faster let recursion calculate result instead of loading somewher...
Read more