Load many large bitmap images as thumbnails - Android -

-

i'm working on media player app , wish load album art images display in listview. right works fine images i'm auto-downloading last.fm under 500x500 png's. however, added panel app allows viewing full screen artwork i've replaced of artworks large (1024x1024) png's instead.

now when scroll on several albums high res artwork, java.lang.outofmemoryerror on bitmapfactory.

    static public bitmap getalbumartfromcache(string artist, string album, context c)     {     bitmap artwork = null;     file dirfile = new file(sourcelistoperations.getalbumartpath(c));     dirfile.mkdirs();     string artfilepath = sourcelistoperations.getalbumartpath(c) + file.separator + sourcelistoperations.makefilename(artist) + "_" + sourcelistoperations.makefilename(album) + ".png";     file infile = new file(artfilepath);     try     {         artwork = bitmapfactory.decodefile(infile.getabsolutepath());     }catch(exception e){}     if(artwork == null)     {         try         {             artwork = bitmapfactory.decoderesource(c.getresources(), r.drawable.icon);         }catch(exception ex){}     }     return artwork;     }

is there can add limit size of resulting bitmap object say, 256x256? that's bigger thumbnails need , make duplicate function or argument fetch full size artwork displaying full screen.

also, i'm displaying these bitmaps on imageviews small, around 150x150 200x200. smaller images scale down nicer large ones do. there way apply downscaling filter smooth image (anti-aliasing perhaps)? don't want cache bunch of additional thumbnail files if don't have to, because make managing artwork images more difficult (currently can dump new ones in directory , automatically used next time loaded).

the full code @ http://github.org/calcprogrammer1/calctunes, in src/com/calcprogrammer1/calctunes/albumartmanager.java, though there's not different in other function (which falls checking last.fm if image missing).

i use private function setup size want thumbnails:

//decodes image , scales reduce memory consumption public static bitmap getscaledbitmap(string path, int newsize) {     file image = new file(path);      bitmapfactory.options options = new bitmapfactory.options();     options.injustdecodebounds = true;     options.ininputshareable = true;     options.inpurgeable = true;      bitmapfactory.decodefile(image.getpath(), options);     if ((options.outwidth == -1) || (options.outheight == -1))         return null;      int originalsize = (options.outheight > options.outwidth) ? options.outheight             : options.outwidth;      bitmapfactory.options opts = new bitmapfactory.options();     opts.insamplesize = originalsize / newsize;      bitmap scaledbitmap = bitmapfactory.decodefile(image.getpath(), opts);      return scaledbitmap;      }

Comments

Post a Comment

Popular posts from this blog

c++ - Function signature as a function template parameter -

-
i'd use function signature template argument. works great classes, when try same trick function templates, msvc throws error: error c2768: 'func' : illegal use of explicit template arguments here's code: template <typename signature> void func(); template <typename r, typename a1> void func<r(a1)>(); what should make work? you cannot partially specialize function template, not supported language. can create partially specialized class template static member function, , possibly trampoline function instantiate class template , invoke static function. something this: namespace detail { template<typename signature> struct helper; template<typename r, typename a1> struct helper<r(a1)> { static void call() { // stuff r , a1... } }; } template<typename signature> void func() { detail::helper<signature>::call(); }
Read more

algorithm - What are some ways to combine a number of (potentially incompatible) sorted sub-sets of a total set into a (partial) ordering of the total set? -

-
i have sorting problem i'm pretty sure doesn't have canonical "answer" - has number of different approaches, each pros/cons. i'm interested in hearing different approaches. suppose bunch of people {p_i | i=1,...,m} ranking favorite ice cream flavors. in total there n different flavors, single person p_i ranks n_i << n flavors or familiar with. i'm interested in combining these sub-rankings plausible overall ranking of n flavors. for concrete situation: m , n both 1000 (by coincidence), , each n_i 20 . can assume there's enough overlap in flavors people rank such no flavor "isolated". again, i'm interested in hearing different ways approach this, if there isn't single clear answer. thanks! one way approach problem construct directed cyclic graph representing of constraints on ordering of elements. nodes in graph represent different elements compared , have edge first node second node if had ranked first e...
Read more

How to call a javascript function after the page loads with a chrome extension? -

-
there's function on page want call after loads. not own page, can't insert html it. can please provide specific examples how chrome extension or greasemonkey? (function submitaction() ). both chrome extensions , greasemonkey offer ways specify when script inject if executed. in chrome extension, you set in manifest : "content_scripts": [ { "run_at" : "document_idle", in greasemonkey compatible userscripts, set in metadata // @run-at document-end in both cases, have add script if want ensure resources loaded when function executed : document.addeventlistener('load', submitaction);
Read more