Skip to main content

BookCover plugin test page

This post is for testing BookCover plugin. ((The previous test page has some comments from users.))

The 'Books Reading' section in the sidebar is also using this plugin.

  1. [ bookcover:1932394613]
    [bookcover:1932394613]


  2. [ bookcover:1590598385(Smart and Gets Things Done)]
    [bookcover:1590598385(Smart and Gets Things Done)]


  3. [ bookcover:1591841380(Wikinomics : How Mass Collaboration Changes Everything)]
    [bookcover:1591841380(Wikinomics : How Mass Collaboration Changes Everything)]


  4. [ bookcover:8995856408]
    [bookcover:8995856408]


  5. [ bookcover:8831793721]
    [bookcover:8831793721]


  6. [ bookcover:9788831793728]
    [bookcover:9788831793728]


Labels

Labels:

Comments

  1. AndreaSeptember 26, 2007 at 11:48 AM

    Do you know an italian service?

    I try to 'grab' image from some other service but there is a little problem in image size.

    Country code:88
    http://image.anobii.com/anobi/image_item.php?type=1&isbn=${isbn}

    Country code:9788
    http://giotto.ibs.it/cop/copt13.asp?f=${isbn}

    ReplyDelete
  2. iwonguSeptember 27, 2007 at 6:35 AM

    Hi, Andrea.
    I can't connect the URLs you supplied. What's your problem in image size?

    ReplyDelete
  3. AndreaOctober 4, 2007 at 1:05 AM

    Image book "A" is bigger (or smaller) than image book "B".
    A good idea? manage the image size! :D

    ReplyDelete
  4. AndreaOctober 4, 2007 at 1:14 AM

    Try:

    http://image.anobii.com/anobi/image_item.php?type=3&isbn=8831793721
    http://image.anobii.com/anobi/image_item.php?type=1&isbn=8831793721

    http://giotto.ibs.it/cop/copt13.asp?f=9788831793728
    http://giotto.ibs.it/cop/copj13.asp?f=9788831793728

    ReplyDelete
  5. iwonguOctober 4, 2007 at 8:01 AM

    There is no option for image size in this plugin, yet. :-|
    But, I decide to add this feature soon. This feature will use 'width' and 'height' attribute in 'img' tag. So the result image might not be clean enough.

    Thanks for using this plugin. :-)

    ReplyDelete
  6. hollyOctober 9, 2007 at 5:26 PM

    Is support coming for the current standard 13 digit ISBNs?

    ReplyDelete
  7. iwonguOctober 10, 2007 at 1:26 AM

    The current version can be used with 13 digits ISBNs. It's sure that you must register new URLs for 13 digit ISBN in the configuration page. (But I could not find the URL of Amazon for 13 digit ISBN. :-| Anyone who found this?)

    ReplyDelete
  8. MalyOctober 24, 2007 at 2:22 AM

    [ bookcover:0609608002]

    ReplyDelete
  9. BenJanuary 2, 2008 at 6:29 PM

    Liking the plugin, but one feature request and/or possible hack tip request from a non PHP guy.

    I'd like to link these images to amazon, a library catalog, etc. Can the output be modified to a linkable image with an OpenURL search string?

    ReplyDelete
  10. iwonguJanuary 4, 2008 at 9:08 AM

    (I don't know what the OpenURL is.)

    Currently, you can't link these images to some book store sites like amazon. It's not impossible, but it needs modifications of php code.

    Sorry. :(

    ReplyDelete
  11. BrianJanuary 19, 2008 at 8:53 AM

    It's very easy to create a link from the image. Here's what I added to the widget configuration:


    [bookcover:0060875410]

    [bookcover:0062517767]

    ReplyDelete
  12. BrianJanuary 19, 2008 at 8:56 AM

    Sorry about the previous comment. The site took my code and added the link to the bookcover text. Basically, I just add and href before the [bookcover:xxxxxxxxxx]. Let's try this again:

    '[bookcover:0060875410]'

    ReplyDelete
  13. BrianJanuary 19, 2008 at 8:57 AM

    a href="http://www.amazon.com/FairTax-Book-Neal-Boortz/dp/0060875410/ref=sr_1_5?ie=UTF8&s=books&qid=1200728037&sr=8-5">[bookcover:0060875410]

    ReplyDelete
  14. BookCover_Wordpress pluginJanuary 22, 2008 at 11:57 AM

    [...] BookCover plugin test page [...]

    ReplyDelete
  15. emmaApril 14, 2008 at 6:11 PM

    Hi,
    I know it's simple but I Can't get the plugin to work. My country is 2, and this is the book I want to add
    http://www.amazon.fr/Code-Source-William-Gibson/dp/2846261563/ref=pd_bxgy_b_img_a?ie=UTF8&qid=1208179992&sr=8-1.

    What shoud i put in the configurations window ?

    This is the code in my sidebar

    [bookcover:2846261563]

    Any chance of helping me ?

    ReplyDelete
  16. emmaApril 15, 2008 at 11:09 AM

    Thanks iwongu. The problem was in fact that I wasn't using the sidebar widget :)

    ReplyDelete
  17. RachelMay 26, 2008 at 5:08 AM

    If I understand, the code work only inside a widget and not if I put it on my sidebar? I try to put it inside my sidebar and it's not working...

    ReplyDelete
  18. FanmeelAugust 12, 2009 at 12:28 AM

    Does it still work in wordpress 2.8.3?

    ReplyDelete
  19. FanmeelAugust 12, 2009 at 12:57 AM

    Yes, it works! But unfortunatly I'm only able to find covers from Amazon (see my site).

    My country code is 90, en I want to get pictures from http://www.bps4m.nl/images/ean/big/${isbn}.jpg, like http://www.bps4m.nl/images/ean/big/9789052616261.jpg. I think it has something to do with the ISBN-13. What do I have to add to the code to get it running? Thanks!

    ReplyDelete
  20. FanmeelAugust 12, 2009 at 11:21 AM

    Problem solved. I just inserted the webadres http://www.bps4m.nl/images/ean/big/${isbn}.jpg en didn't insert text for my countrycode. Now, my covers won't be found at Amazons, but in the Dutch database.

    ReplyDelete
  21. Jenny SchraderFebruary 24, 2010 at 9:32 PM

    I just wanted to thank you for such an excellent plugin. I tried some others and they didn't work nearly as easily or as well. And thanks, too, to Brian for the link to Amazon suggestions. It works perfectly!

    ReplyDelete

Post a Comment

Popular posts from this blog

1의 개수 세기 - 해답

벌써 어제 말한 내일이 되었는데 답을 주신 분이 아무도 없어서 좀 뻘쭘하네요. :-P 그리고 어제 문제에 O(1)이라고 적었는데 엄밀히 얘기하자면 O(log 10 n)이라고 적었어야 했네요. 죄송합니다. ... 문제를 잠시 생각해보면 1~n까지의 수들 중 1의 개수를 얻기 위해서는 해당 숫자 n의 각 자리의 1의 개수가 모두 몇개나 될지를 구해서 더하면 된다는 사실을 알 수 있습니다. 예를 들어 13이라는 수를 생각해 보면 1~13까지의 수에서 1의 자리에는 1이 모두 몇개나 되는지와 10의 자리에는 모두 몇개나 되는지를 구해 이 값을 더하면 됩니다. 먼저 1의 자리를 생각해 보면 1, 11의 두 개가 있으며 10의 자리의 경우, 10, 11, 12, 13의 네 개가 있습니다. 따라서 2+4=6이라는 값을 구할 수 있습니다. 이번엔 234라는 수에서 10의 자리를 예로 들어 살펴 보겠습니다. 1~234라는 수들 중 10의 자리에 1이 들어가는 수는 10, 11, ..., 19, 110, 111, ... 119, 210, 211, ..., 219들로 모두 30개가 있음을 알 수 있습니다. 이 규칙들을 보면 해당 자리수의 1의 개수를 구하는 공식을 만들 수 있습니다. 234의 10의 자리에 해당하는 1의 개수는 ((234/100)+1)*10이 됩니다. 여기서 +1은 해당 자리수의 수가 0이 아닌 경우에만 더해집니다. 예를 들어 204라면 ((204/100)+0)*10으로 30개가 아닌 20개가 됩니다. 이런 방식으로 234의 각 자리수의 1의 개수를 구하면 1의 자리에 해당하는 1의 개수는 ((234/10)+1)*1=24개가 되고 100의 자리에 해당하는 개수는 ((234/1000)+1)*100=100이 됩니다. 이들 세 수를 모두 합하면 24+30+100=154개가 됩니다. 한가지 추가로 생각해야 할 점은 제일 큰 자리의 수가 1인 경우 위의 공식이 아닌 다른 공식이 필요하다는 점입니다. 예를 들어 123에서 100의 자리에 해당하는 1의 개수는 ((123/1...
3 comments
Read more

CodeHighlighter plugin test page.

This post is for testing CodeHighlighter plugin which uses GeSHi as a fontifier engine. ((Those code blocks are acquired from Google Code Search .)) ((For more supported languages, go CodeHighlighter plugin or GeSHi homepage.)) C++ (<pre lang="cpp" lineno="1">) class nsScannerBufferList { public: /** * Buffer objects are directly followed by a data segment. The start * of the data segment is determined by increment the |this| pointer * by 1 unit. */ class Buffer : public PRCList { public: Buffer() { ++index_; } PHP (<pre lang="php" lineno="4">) for ($i = 0; $i $value = ord( $utf8_string[ $i ] ); if ( $value < 128 ) { // ASCII $unicode .= chr($value); } else { if ( count( $values ) == 0 ) { $num_octets = ( $value } $values[] = $value; Lisp (<pre lang="lisp">) ;;; Assignment (define-caller-pattern setq ((:star var fo...
88 comments
Read more

std::map에 insert하기

얼마전 회사 동료가 refactoring한 코드를 열심히 revert하고 있어서 물어보니 다음과 같은 문제였습니다. 원래 코드와 refactoring한 코드는 다음과 같더군요. nvp[name] = value; // original code nvp.insert(make_pair(name, value)); // refactored 아시겠지만 위의 두 라인은 전혀 다른 기능을 하죠. C++03에 보면 각각 다음과 같이 설명되어 있습니다. 23.1.2/7 Associative containers a_uniq.insert(t): pair<iterator, bool> inserts t if and only if there is no element in the container with key equivalent to the key of t. The bool component of the returned pair indicates whether the insertion takes place and the iterator component of the pair points to the element with key equivalent to the key of t. 23.3.1.2/1 map element access [lib.map.access] T& operator[](const key_type& x); Returns: (*((insert(make_pair(x, T()))).first)).second. 원래 코드는 매번 새 값으로 이전 값을 overwrite했지만 새 코드는 이전에 키가 존재하면 새값으로 overwrite하지 않습니다. 따라서 원래 기능이 제대로 동작하지 않게 된것이죠. 그래서 물어봤죠. "왜 이렇게 했어?" "insert가 성능이 더 좋다 그래서 했지." :-? 사실 Fowler 아저씨는 Refactoring 책에서 refactoring은 성능을 optimizing하기 위한 것이 아니다라...
3 comments
Read more