StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
1937155
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2009-12-20T21:37:47.363
FavoriteCount
0
LastActivityDate
2009-12-20T21:37:47.363
LastEditDate
LastEditorUserId
0
OwnerUserId
182742
ParentId
1929106
PostTypeId
2
Score
0
ViewCount
0
LastEditorDisplayName
text
Body
It seems to me you have probably leveraged FreeImage as far as it can go. The FreeImage source (<a href="http://freeimage.sourceforge.net/download.html" rel="nofollow noreferrer">http://freeimage.sourceforge.net/download.html</a>, BitmapAccess.cpp::FreeImage_AllocateT) seems to malloc image storage as a one-dimensional array: <pre><code>unsigned dib_size = FreeImage_GetImageSize(width, height, bpp); bitmap->data = (BYTE *)FreeImage_Aligned_Malloc(dib_size * sizeof(BYTE), FIBITMAP_ALIGNMENT); </code></pre> Here, dib_size is "device independent bitmap size", and bpp is "bits per pixel". I assume you use PixelAccess.cpp::FreeImage_GetScanLine() to get the line to copy: <pre><code>BYTE * DLL_CALLCONV FreeImage_GetScanLine(FIBITMAP *dib, int scanline) { return (dib) ? CalculateScanLine(FreeImage_GetBits(dib), FreeImage_GetPitch(dib), scanline) : NULL; } </code></pre> which calls <pre><code>inline unsigned char * CalculateScanLine(unsigned char *bits, unsigned pitch, int scanline) { return (bits + (pitch * scanline)); } </code></pre> which seems to be O(1) for array-based lookup. Since FreeImage internally uses static one-dimensional array storage, it does not seem readily apparent how you will achieve better than O(n) performance when growing the image (for example, when inserting copies of rows). It seems to me the best FreeImage can do is internally malloc new storage sufficient to grow the image, then copy the image data from the source to the new image. This would seem to be O(n). Using a new data structure (such as B-tree) would take some effort but would give you better insertion-time characteristics (O(log(n)). However, the trade-off for speedup is increased storage space--you would be storing each pixel in a larger amount of space. Since GDI+ seems closed-source, I am not sure how it implements bitmaps, but given the performance characteristics, it seems worse than FreeImage.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POInserting lines of pixels into an image quickly
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USiokevins
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.