[B! array] yassã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

yass id:yass

arrayã«é–¢ã™ã‚‹yassã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (15)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®å…¥é–€ã®å…¥é–€ - EchizenBlog-Zwei
æœ€è¿‘ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ (Succinct Data Structure)ãŒã˜ã‚ã˜ã‚äººæ°—ãŒå‡ºã¦ãã¦ã„ã‚‹ã‚ˆã†ã«æ„Ÿã˜ã‚‹ã®ã§å…¥é–€ã®å…¥é–€ã€ãã‚‰ã„ã®è¨˜äº‹ã‚’æ›¸ã„ã¦ãŠãã€‚ ã“ã®è¨˜äº‹ã§ã¯ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ãŠã„ã¦æœ€ã‚‚åŸºæœ¬çš„ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚‹å®Œå‚™è¾žæ›¸(Fully Indexable Dictionary)ã«ã¤ã„ã¦èª¬æ˜Žã™ã‚‹ã€‚ æ–°ã—ã„æ¦‚å¿µãŒå‡ºã¦ããŸæ™‚ã«æ°—ã«ãªã‚‹ã®ã¯ã€Œã©ã†ã‚„ã£ã¦å®Ÿç¾ã™ã‚‹ã®ã‹ã€ã€Œãã‚ŒãŒã§ãã‚‹ã¨ä½•ãŒå¬‰ã—ã„ã®ã‹ã€ã¨ã„ã†2ç‚¹ã ã¨æ€ã†ã€‚ å‰è€…ã«ã¤ã„ã¦ã¯ã“ã®è¨˜äº‹(http://d.hatena.ne.jp/takeda25/20140201/1391250137)ãŒã‚ã‹ã‚Šã‚„ã™ã„ã®ã§ã“ã“ã§ã¯è¿°ã¹ãªã„ã€‚ã“ã®è¨˜äº‹ã§ã¯ã€Œå®Œå‚™è¾žæ›¸ãŒã‚ã‚‹ã¨ä½•ãŒå¬‰ã—ã„ã®ã‹ã€ã«ã¤ã„ã¦èª¬æ˜Žã™ã‚‹ã€‚ å®Œå‚™è¾žæ›¸ã¨ã¯ å®Œå‚™è¾žæ›¸ã¯rankãŠã‚ˆã³selectã¨ã„ã†æ“ä½œãŒå®šæ•°æ™‚é–“ã§å®Ÿè¡Œã§ãã‚‹ãƒ“ãƒƒãƒˆåˆ—ã®ã“ã¨ã€‚rank(i)ã¯iç•ªç›®ã®ãƒ“ãƒƒãƒˆã‚ˆã‚Šå‰ã«ã„ãã¤1ãŒã‚ã‚‹ã‹ã‚’è¿”
yass 2014/05/17
" ã€Œå®Œå‚™è¾žæ›¸ãŒã‚ã‚‹ã¨ä½•ãŒå¬‰ã—ã„ã®ã‹ã€/ 0ã‹ã‚‰(m-1)ã¾ã§ã®å€¤ã‚’å–ã‚Š / é›†åˆã¯é…åˆ—ã‹ã‚‰ãƒ‡ãƒ¼ã‚¿ã®é †ç•ªã¨ã„ã†æƒ…å ±ã‚’æ¶ˆã—åŽ»ã£ãŸã‚‚ã®ã§mãƒ“ãƒƒãƒˆã§è¡¨ç¾ / selectã¨ã„ã†æ“ä½œã‚’é€šã—ã¦ã‚ãŸã‹ã‚‚é€šå¸¸ã®é…åˆ—ã®ã‚ˆã†ã«è¦ç´ ã‚¢ã‚¯ã‚»ã‚¹ãŒã§ãã‚‹ "

succinct data structure

array
ãƒªãƒ³ã‚¯
GitHub - OpenHFT/Java-Lang: Java Language support
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
yass 2014/04/20
" This module provides marshalling, de-marshalling and handling of thread safe off heap memory through ByteBuffers. "

java

OpenHFT

offheap

ByteBuffer

serialize

array

queue
ãƒªãƒ³ã‚¯
ã‚¿ã‚°æ¤œç´¢ã™ã‚‹ãªã‚‰PostgreSQLã§æ±ºã¾ã‚Šï¼
(Last Updated On: 2018å¹´8æœˆ13æ—¥)PostgreSQL Advent Calender 2013ã€13æ—¥ç›®ã®ã‚¨ãƒ³ãƒˆãƒªã§ã™ã€‚ è¡¨é¡Œã®é€šã‚Šã€Œã‚¿ã‚°æ¤œç´¢ã™ã‚‹ãªã‚‰PostgreSQLã§æ±ºã¾ã‚Šï¼ã€ã§ã™ã€‚ è¿½è¨˜ï¼šJSONã®å ´åˆã¯PostgreSQLã®JSONBåž‹ã‚’åˆ©ç”¨ã—ã¦ã‚¿ã‚°æ¤œç´¢ã‚’è¡Œã†ã‚’å‚ç…§ RDBã¯ã‚¿ã‚°ãŒè‹¦æ‰‹ Webã‚¢ãƒ—ãƒªã§ã¯RDBã§ã¯å–ã‚Šæ‰±ã„ã¥ã‚‰ã„ãƒ‡ãƒ¼ã‚¿ã‚’å–ã‚Šæ‰±ã†äº‹ãŒã‚ˆãã‚ã‚Šã¾ã™ã€‚ã‚¿ã‚°ã®ç®¡ç†ãƒ»æ¤œç´¢ã¯ãã®ä¸€ã¤ã§ã™ã€‚ RDBã¯ã‚¿ã‚°æƒ…å ±ã®ç®¡ç†ãƒ»æ¤œç´¢ã‚’ã—ã£ã‹ã‚Šã‚„ã‚Œã¾ã™ãŒã€ã©ã¡ã‚‰ã‹ã¨è¨€ã†ã¨è‹¦æ‰‹ãªåˆ†é‡Žã§ã™ã€‚ã—ã‹ã—ã€PostgreSQLã® é…åˆ— GINï¼ˆGeneralized Inverse Index â€“ è»¢ç½®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ï¼‰ ã‚’ä½¿ã†ã¨ç°¡å˜ã‹ã¤é«˜é€Ÿã«å‡¦ç†ã§ãã¾ã™ã€‚ PostgreSQLã‚’ä½¿ã†ã¨ã‚¿ã‚°æ¤œç´¢ãŒç°¡å˜ãƒ»é«˜é€Ÿã«å®Ÿç¾ã§ãã¾ã™ãŒã€Googleã§ã€Œã‚¿ã‚°æ¤œç´¢ PostgreSQLã€ã¨æ¤œç´¢ã—ã¦ã‚‚
yass 2013/12/13
" RDBã¯ã‚¿ã‚°æƒ…å ±ã®ç®¡ç†ãƒ»æ¤œç´¢ã‚’ã—ã£ã‹ã‚Šã‚„ã‚Œã¾ã™ãŒã€ã©ã¡ã‚‰ã‹ã¨è¨€ã†ã¨è‹¦æ‰‹ãªåˆ†é‡Žã§ã™ã€‚ã—ã‹ã—ã€PostgreSQLã® / é…åˆ— / GINï¼ˆGeneralized Inverse Index â€“ è»¢ç½®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ï¼‰ ã‚’ä½¿ã†ã¨ç°¡å˜ã‹ã¤é«˜é€Ÿã«å‡¦ç†ã§ãã¾ã™ã€‚"

postgresql

tag

array

GIS

gin

index
ãƒªãƒ³ã‚¯
Big-O Isn't Everything
yass 2013/08/07
sort

heapsort

integer

array
ãƒªãƒ³ã‚¯
Big-O Isn't Everything, Part 2
yass 2013/08/07
hash

binary search

array

primitive

hashtable

memory

comparison
ãƒªãƒ³ã‚¯
Java Serialization Performance: Methods, Performance, and Security
yass 2013/05/04
" If you have primitive array fields â€“ always use bulk methods to process them. ByteBuffer bulk methods performance is close to those of Unsafe (but ByteBuffer are always a little slower). "

java

serialize

unsafe

offheap

primitive

array
ãƒªãƒ³ã‚¯
GitHub - alexkasko/unsafe-tools: Tools to work with off-heap memory using sun.misc.Unsafe
yass 2013/05/03
" Tools to work with off-heap memory using sun.misc.Unsafe "

java

offheap

unsafe

memory

array

binary search
ãƒªãƒ³ã‚¯
GitHub - xerial/larray: Large off-heap arrays and mmap files for Scala and Java
LArray can create arrays with more than 2G(2^31) entries. 2^31 -1 (2G) is the limitation of the default Java/Scala array size, because these arrays use 32-bit signed integer (int) as indexes. LArray uses long type indexes of 64-bit signed integers to resolve this limitation. For example, the entire human genome data (3GB) can be stored in LArray. LArray can be released immediately from the memory.
yass 2013/05/03
" A library for managing large off-heap arrays that can hold more than 2G (2^31) entries in Java and Scala. Notably LArray is disposable by calling LArray.free or you can let GC automatically release the memory. LArray can be used to create an mmap (memory-mapped file) whose size is more than 2GB. "

java

offheap

memory

array

gc

scala

unsafe

mmap
ãƒªãƒ³ã‚¯
é‡ã¿ã‚’æŒã¤è¦ç´ ã®é…åˆ—ã‹ã‚‰ã€ãƒ©ãƒ³ãƒ€ãƒ ã«1ã¤é¸æŠžã™ã‚‹ã€‚ - xif ãƒŽãƒ¼ãƒˆ
åœ°é“ã« for ã ã®ä½¿ã£ã¦å‡¦ç†ã—ã¦ã‚‚ã„ã„ã‚“ã ã‘ã©ã€é…åˆ—ã®è¦ç´ ã®æ•°ãŒå·¨å¤§ã«ãªã£ãŸã¨ãã®ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ãŒå¿ƒé…ã ã£ãŸã®ã§ã€äºŒåˆ†æŽ¢ç´¢ã«ã—ã¦ã¿ãŸã€‚ ä¾‹ãˆã°ã€ ã€Žæ•°åç¨®é¡žã‚ã‚‹ãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ã®ã†ã¡1ã¤ã‚’ãƒ©ãƒ³ãƒ€ãƒ ã«è¡¨ç¤ºã—ãŸã„ã‘ã©ã€ã†ã¡æ•°ç¨®é¡žã¯ãƒ¬ã‚¢ã«ã—ãŸã„ã€ ã¿ãŸã„ãªæ™‚ã«ä½¿ãˆã‚‹ã¯ãšã€‚ ã“ã†ã„ã†å‡¦ç†ã¯å‰²ã¨é »ç¹ã«ä½¿ã†ã®ã§ã€æ±Žç”¨åŒ–ã—ã¦ãŠãã¨ä¾¿åˆ©ã€‚ ã‚µãƒ³ãƒ—ãƒ«ã‚³ãƒ¼ãƒ‰ã¯ javascript ã€‚ /** * weight ãŒå¤§ãã„ã»ã©é¸æŠžã•ã‚Œã‚‹å¯èƒ½æ€§ãŒé«˜ã„ã€‚ * weight ã¯ 1 ä»¥ä¸Šã§ãªã‘ã‚Œã°ãªã‚‰ãªã„ã€‚ */ var messages = [ {message: "Hello1", weight: 100}, // 100/188 ã§é¸æŠžã•ã‚Œã‚‹ã€‚ {message: "Hello2", weight: 50}, // 50/188 ã§é¸æŠžã•ã‚Œã‚‹ã€‚ {message: "Hello3", weight: 25}, //
yass 2013/03/10
random

array
ãƒªãƒ³ã‚¯
ICU-docs - International Components for Unicode Docs
yass 2013/03/02
java

byte

array
ãƒªãƒ³ã‚¯
Intersecting Two Sorted Integer Arrays
An interesting probl em I've run to recently is the following (I tried to express it using Jon Bentley's convention): Input: Two sorted integer arrays A and B in increasing order and of different sizes N and M, respectively. Output: A sorted integer array C in increasing order that contains elements that appear in both A and B Contraints: No duplicates are allowed in C Example: For input A = {3,6,8
yass 2013/01/09
intersection

integer

sort

array

binary search

merge sort
ãƒªãƒ³ã‚¯
Array or List in Java. Which is faster?
yass 2012/12/12
java

array

list

collection
ãƒªãƒ³ã‚¯
ã‚¯ãƒ©ã‚¹ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã®é…åˆ—ã‚’ä½¿ã†ã¨ãã®æ³¨æ„ç‚¹ - ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ç¾å½¹ç¶šè¡Œ
intåž‹ã®é…åˆ—ã‚’ä½¿ã†ã¨ãã¯ä»¥ä¸‹ã®ã‚ˆã†ã«ã—ã¾ã™ã€‚ã“ã‚Œã¯å•é¡Œãªã„ã§ã™ãã€‚ int[] array = new int[10]; // (1) ã—ã‹ã—è‡ªåˆ†ã§å®šç¾©ã—ãŸã‚¯ãƒ©ã‚¹ã®ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã®é…åˆ—ã‚’ä½¿ã†å ´åˆã¯ã€åŒã˜ã‚ˆã†ã«ã—ã¦ã‚‚ã†ã¾ãã„ãã¾ã›ã‚“ã€‚ class NewClass{ int a; int b; } public static void main(String[] args) { NewClass[] dim = new NewClass[3]; // (2) dim[0].a = 1; dim[0].b = 10; dim[1].a = 2; dim[1].b = 20; dim[2].a = 3; dim[2].b = 30; } (1)ã¨åŒæ§˜ã«(2)ã¨æ›¸ã„ãŸã®ã«ã€ã“ã‚Œã‚’å®Ÿè¡Œã™ã‚‹ã¨Null Pointer ExceptionãŒç™ºç”Ÿã—ã¦ã—ã¾ã„ã¾ã™ã€‚ èª¿ã¹ãŸã¨ã“ã‚ã€(2)ã¯ã€ã‚ªãƒ–ã‚¸ã‚§ã‚¯ãƒˆã‚’å…¥ã‚Œ
yass 2012/12/12
java

array

null
ãƒªãƒ³ã‚¯
é…åˆ— vs ArrayListã€é€Ÿãã¦è»½ã„ã®ã¯ã©ã£ã¡ï¼ï¼Ÿ - åœ°å¹³ç·šã«è¡Œã
Javaã®ã‚½ãƒ¼ã‚¹ã§ã€ãŸã¾ã«ã€ŒArrayListã‚’ä½¿ã£ã¦ã„ã‚‹ã‘ã©ã€ä»£å…¥ã™ã‚‹è¦ç´ æ•°ã¯æ±ºã¾ã£ã¦ã„ã‚‹ã€ã¨ã„ã†ã®ã‚’è¦‹ã‹ã‘ã¾ã™ã€‚ ã“ã†ã„ã†ã®ã‚’è¦‹ã‚‹ã¨ã€ã€Œè¦ç´ æ•°ãŒæ±ºã¾ã£ã¦ã„ã‚‹ãªã‚‰ã€å¯å¤‰ã®ã‚‚ã®(ArrayList)ã˜ã‚ƒãªãã¦å›ºå®šã®ã‚‚ã®(é…åˆ—)ã‚’ä½¿ã£ãŸæ–¹ãŒé€Ÿãã¦ãƒ¡ãƒ¢ãƒªä½¿ç”¨é‡ã‚‚å°‘ãªãã¦æ¸ˆã‚€ã‚“ã˜ã‚ƒãªã„ã®ã‹ãªã€ã¨ã„ã¤ã‚‚æ€ã„ã¾ã™ã€‚ ã§ã‚‚ã€ã‚ˆãè€ƒãˆãŸã‚‰è©¦ã—ã¦ã„ãªã„ãƒ»ãƒ»ãƒ»ã€‚ ãã“ã§å®Ÿé¨“ã€‚ ã€Œé…åˆ—ã«ä»£å…¥ã€ã™ã‚‹ã®ã¨ã€ŒArrayListã«è¿½åŠ ã€ã™ã‚‹ã®ã¯ã€ã©ã¡ã‚‰ãŒé€Ÿã„ãƒ»è»½ã„ãƒ»ã†ã¾ã„ï¼ï¼Ÿ - ã‚½ãƒ¼ã‚¹ã¯æœ€å¾Œã«æ·»ä»˜ã—ã¾ã™ã€‚ å…ˆã«çµæžœã ã‘ã€‚ é…åˆ—ã¨ArrayListã§ã¯ã€ åˆæœŸå®¹é‡ã‚’æŒ‡å®šã—ãªã‘ã‚Œã°ã€é…åˆ—ã®æ–¹ãŒï¼“å€é€Ÿã„ åˆæœŸå®¹é‡ã‚’æŒ‡å®šã—ã¦ã‚‚ã€é…åˆ—ã®æ–¹ãŒï¼’å€é€Ÿã„ã€‚ ï¼ˆãŸã ã€10,000,000ä¸‡å›žãƒ«ãƒ¼ãƒ—ã—ã¦ã¡ã‚‡ã£ã¨ã®å·®ãŒå‡ºã‚‹ãã‚‰ã„ã€‚ã©ã¡ã‚‰ã§ã‚‚ååˆ†ã«é€Ÿã„ï¼‰ é…åˆ—ã¨ArrayListã§ã¯ã€ åˆæœŸå®¹é‡ã‚’æŒ‡å®šã—ãªã‘ã‚Œã°ã€ArrayListã®æ–¹ãŒãƒ¡
yass 2012/12/12
java

collection

array

list
ãƒªãƒ³ã‚¯
æ•´æ•°åˆ—åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æœ€å‰ç·š - ny23ã®æ—¥è¨˜
ã¡ã‚‡ã†ã©äºŒå¹´ãã‚‰ã„å‰ï¼Œæ©Ÿæ¢°å¦ç¿’ã§ç–Žãƒ™ã‚¯ãƒˆãƒ«ã®åœ§ç¸®ã«æƒ…å ±æ¤œç´¢ã§ã‚ˆãä½¿ã‚ã‚Œã‚‹æ•´æ•°åˆ—ã®åœ§ç¸®æŠ€è¡“ã‚’ä½¿ã†ã“ã¨ã‚’æ¤œè¨Žã—ãŸã“ã¨ãŒã‚ã£ãŸï¼ˆã‚ªãƒ³ãƒ©ã‚¤ãƒ³å¦ç¿’ã§ã‚ãƒ£ãƒƒã‚·ãƒ¥ã‚’å®Ÿè£…ã—ã¦ã¿ãŸ - ny23ã®æ—¥è¨˜ï¼‰ï¼Žãã®ã¨ãã¯ï¼Œã‚ªãƒ³ãƒ©ã‚¤ãƒ³ã§åœ§ç¸®ã— Disk ã«ä¿å˜ï¼Œåœ§ç¸®ã—ãŸãƒ™ã‚¯ãƒˆãƒ«ã¯é™½ã«ãƒ¡ãƒ¢ãƒªã«ç½®ã‹ãšèªã‚€ï¼ˆOS ã«ä»»ã›ã‚‹ï¼‰ã¨ã„ã†å®Ÿè£…ã§ï¼Œï¼ˆDisk IO ã®ã‚ªãƒ¼ãƒãƒ¼ãƒ˜ãƒƒãƒ‰ãŒå¤§ããï¼‰åœ§ç¸®ã•ãˆã™ã‚Œã°ä½•ã‚’ä½¿ã£ã¦ã‚‚å¤§å·®ãªã—ã¨ã„ã†èº«ã‚‚è“‹ã‚‚ãªã„çµè«–ã«ãªã£ãŸï¼ˆçµå±€2è¡Œã§æ›¸ã‘ã‚‹æœ€ã‚‚å˜ç´”ãª Variable byte code ã‚’æŽ¡ç”¨ï¼‰ï¼Ž ãã‚Œä»¥é™ã¯æ•´æ•°åˆ—åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«é–¢ã™ã‚‹çŸ¥è˜ã‚‚ NewPFD ãã‚‰ã„ã§æ¢ã¾ã£ã¦ã„ãŸã®ã ã‘ã©ï¼Œã¤ã„å…ˆæ—¥ï¼Œç¾æ™‚ç‚¹ã§æœ€é€Ÿã®åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ææ¡ˆï¼‹ã“ã“æ•°å¹´ã®ä¸»ãªæ•´æ•°åˆ—åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ˆSimple-8b (J. Software Pract. Exper. 2010), VSEncoding (CIKM 20
yass 2012/09/17
compression

integer

array

varint
ãƒªãƒ³ã‚¯
1