Assists music production by grouping standalone programs into sessions. Community version of "Non Session Manager".
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

894 lines
19KB

  1. /*******************************************************************************/
  2. /* Copyright (C) 2007-2008 Jonathan Moore Liles */
  3. /* */
  4. /* This program is free software; you can redistribute it and/or modify it */
  5. /* under the terms of the GNU General Public License as published by the */
  6. /* Free Software Foundation; either version 2 of the License, or (at your */
  7. /* option) any later version. */
  8. /* */
  9. /* This program is distributed in the hope that it will be useful, but WITHOUT */
  10. /* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or */
  11. /* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for */
  12. /* more details. */
  13. /* */
  14. /* You should have received a copy of the GNU General Public License along */
  15. /* with This program; see the file COPYING. If not,write to the Free Software */
  16. /* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. */
  17. /*******************************************************************************/
  18. /* This is a generic double-buffering, optimizing canvas interface to
  19. grids (patterns and phrases). It draws only what is necessary to keep
  20. the display up-to-date. Actual drawing functions are in draw.C */
  21. #include "canvas.H"
  22. #include "pattern.H"
  23. #include "gui/draw.H"
  24. #include "common.h"
  25. #include "non.H"
  26. cell_t **
  27. Canvas::_alloc_array ( void )
  28. {
  29. cell_t **a;
  30. int one = sizeof( typeof( a ) ) * m.vp->w;
  31. int two = sizeof( typeof( a[0] ) ) * (m.vp->h * m.vp->w);
  32. a = (cell_t **) malloc( one + two );
  33. m.size = one + two;
  34. cell_t *c = (cell_t *) (((unsigned char *)a) + one);
  35. for ( uint x = m.vp->w; x-- ; )
  36. {
  37. a[x] = c;
  38. c += m.vp->h;
  39. for ( uint y = m.vp->h; y-- ; )
  40. {
  41. a[ x ][ y ].flags = 0;
  42. a[ x ][ y ].state = -1;
  43. a[ x ][ y ].shape = SQUARE;
  44. a[ x ][ y ].color = 0;
  45. }
  46. }
  47. m.w = m.vp->w;
  48. m.h = m.vp->h;
  49. return a;
  50. }
  51. Canvas::Canvas ( )
  52. {
  53. m.origin_x = m.origin_y = m.height = m.width = m.div_w = m.div_h = m.playhead = m.margin_top = m.margin_left = m.playhead = m.w = m.h = m.p1 = m.p2 = 0;
  54. m.margin_top = ruler_height;
  55. m.draw = false;
  56. m.ruler_drawn = false;
  57. m.mapping_drawn = false;
  58. m.grid_drawn = false;
  59. m.current = m.previous = NULL;
  60. m.row_compact = true;
  61. m.maxh = 128;
  62. m.vp = NULL;
  63. }
  64. void
  65. Canvas::handle_event_change ( void )
  66. {
  67. /* mark the song as dirty and pass the signal on */
  68. song.dirty( true );
  69. signal_draw();
  70. }
  71. /** change grid to /g/, returns TRUE if new grid size differs from old */
  72. void
  73. Canvas::grid ( Grid *g )
  74. {
  75. m.grid = g;
  76. if ( ! g )
  77. return;
  78. m.vp = &g->viewport;
  79. char *s = m.vp->dump();
  80. DEBUG( "viewport: %s", s );
  81. free( s );
  82. m.ruler_drawn = false;
  83. resize_grid();
  84. changed_mapping();
  85. m.shape = m.grid->draw_shape();
  86. /* connect signals */
  87. /* FIXME: what happens when we do this twice? */
  88. g->signal_events_change.connect( mem_fun( this, &Canvas::handle_event_change ) );
  89. g->signal_settings_change.connect( signal_settings_change.make_slot() );
  90. signal_draw();
  91. signal_settings_change();
  92. }
  93. /** keep row compaction tables up-to-date */
  94. void
  95. Canvas::_update_row_mapping ( void )
  96. {
  97. /* reset */
  98. for ( int i = 128; i-- ; )
  99. m.rtn[i] = m.ntr[i] = -1;
  100. DEBUG( "updating row mapping" );
  101. /* rebuild */
  102. int r = 0;
  103. for ( int n = 0; n < 128; ++n )
  104. {
  105. if ( m.grid->row_name( n ) )
  106. {
  107. m.rtn[r] = n;
  108. m.ntr[n] = r;
  109. ++r;
  110. }
  111. }
  112. if ( m.row_compact && r )
  113. m.maxh = r;
  114. else
  115. m.maxh = 128;
  116. m.vp->h = min( m.vp->h, m.maxh );
  117. }
  118. /** change grid mapping */
  119. void
  120. Canvas::changed_mapping ( void )
  121. {
  122. _update_row_mapping();
  123. m.mapping_drawn = false;
  124. m.vp->y = (m.maxh / 2) - (m.vp->h / 2);
  125. resize();
  126. int old_margin = m.margin_left;
  127. m.margin_left = 0;
  128. m.draw = false;
  129. m.grid->draw_row_names( this );
  130. if ( m.margin_left != old_margin )
  131. signal_resize();
  132. else
  133. signal_draw();
  134. }
  135. Grid *
  136. Canvas::grid ( void )
  137. {
  138. return m.grid;
  139. }
  140. /** recalculate node sizes based on physical dimensions */
  141. void
  142. Canvas::resize ( void )
  143. {
  144. if ( ! m.vp )
  145. return;
  146. m.div_w = (m.width - m.margin_left) / m.vp->w;
  147. m.div_h = (m.height - m.margin_top) / m.vp->h;
  148. m.border_w = min( m.div_w, m.div_h ) / 8;
  149. m.mapping_drawn = m.ruler_drawn = false;
  150. }
  151. /** reallocate buffers to match grid dimensions */
  152. void
  153. Canvas::resize_grid ( void )
  154. {
  155. // _update_row_mapping();
  156. resize();
  157. if ( m.vp )
  158. {
  159. if ( m.vp->w != m.w || m.vp->h != m.h ||
  160. m.div_w != m.old_div_w || m.div_h != m.old_div_h )
  161. {
  162. if ( m.grid_drawn )
  163. signal_resize();
  164. m.old_div_w = m.div_w;
  165. m.old_div_h = m.div_h;
  166. }
  167. else
  168. return;
  169. }
  170. DEBUG( "resizing grid %dx%d", m.vp->w, m.vp->h );
  171. if ( m.previous )
  172. {
  173. free( m.previous );
  174. free( m.current );
  175. }
  176. m.current = _alloc_array();
  177. m.previous = _alloc_array();
  178. m.grid_drawn = false;
  179. }
  180. /** inform the canvas with new phsyical dimensions */
  181. void
  182. Canvas::resize ( int x, int y, int w, int h )
  183. {
  184. m.origin_x = x;
  185. m.origin_y = y;
  186. m.width = w;
  187. m.height = h;
  188. resize();
  189. }
  190. /***********/
  191. /* Drawing */
  192. /***********/
  193. /** copy last buffer into current */
  194. void
  195. Canvas::copy ( void )
  196. {
  197. for ( uint y = m.vp->h; y-- ; )
  198. for ( uint x = m.vp->w; x-- ; )
  199. m.current[ x ][ y ] = m.previous[ x ][ y ];
  200. }
  201. /** reset last buffer */
  202. void
  203. Canvas::_reset ( void )
  204. {
  205. cell_t empty = {0,0,0,0};
  206. for ( uint y = m.vp->h; y-- ; )
  207. for ( uint x = m.vp->w; x-- ; )
  208. m.current[ x ][ y ] = empty;
  209. }
  210. /** prepare current buffer for drawing (draw "background") */
  211. void
  212. Canvas::clear ( void )
  213. {
  214. uint rule = m.grid->ppqn();
  215. uint lx = m.grid->ts_to_x( m.grid->length() );
  216. for ( uint y = m.vp->h; y--; )
  217. for ( uint x = m.vp->w; x--; )
  218. {
  219. m.current[ x ][ y ].color = 0;
  220. m.current[ x ][ y ].shape = m.shape;
  221. m.current[ x ][ y ].state = EMPTY;
  222. m.current[ x ][ y ].flags = 0;
  223. }
  224. for ( int x = m.vp->w - rule; x >= 0; x -= rule )
  225. for ( uint y = m.vp->h; y-- ; )
  226. m.current[ x ][ y ].state = LINE;
  227. int sx = (int)(lx - m.vp->x) >= 0 ? lx - m.vp->x : 0;
  228. for ( int x = sx; x < m.vp->w; ++x )
  229. for ( int y = m.vp->h; y-- ; )
  230. m.current[ x ][ y ].state = PARTIAL;
  231. }
  232. /** is /x/ within the viewport? */
  233. bool
  234. Canvas::viewable_x ( int x )
  235. {
  236. return x >= m.vp->x && x < m.vp->x + m.vp->w;
  237. }
  238. /** flush delta of last and current buffers to screen, then flip them */
  239. void
  240. Canvas::flip ( void )
  241. {
  242. /* FIXME: should this not go in clear()? */
  243. if ( m.p1 != m.p2 )
  244. {
  245. if ( viewable_x( m.p1 ) ) draw_line( m.p1 - m.vp->x, F_P1 );
  246. if ( viewable_x( m.p2 ) ) draw_line( m.p2 - m.vp->x, F_P2 );
  247. }
  248. if ( viewable_x( m.playhead ) ) draw_line( m.playhead - m.vp->x, F_PLAYHEAD );
  249. for ( uint y = m.vp->h; y--; )
  250. for ( uint x = m.vp->w; x--; )
  251. {
  252. cell_t *c = &m.current[ x ][ y ];
  253. cell_t *p = &m.previous[ x ][ y ];
  254. if ( *c != *p )
  255. gui_draw_shape( m.origin_x + m.margin_left + x * m.div_w, m.origin_y + m.margin_top + y * m.div_h, m.div_w, m.div_h, m.border_w,
  256. c->shape, c->state, c->flags, c->color );
  257. }
  258. cell_t **tmp = m.previous;
  259. m.previous = m.current;
  260. m.current = tmp;
  261. }
  262. /** redraw the ruler at the top of the canvas */
  263. void
  264. Canvas::redraw_ruler ( void )
  265. {
  266. m.margin_top = gui_draw_ruler( m.origin_x + m.margin_left, m.origin_y, m.vp->w, m.div_w, m.grid->division(), m.vp->x,
  267. m.p1 - m.vp->x, m.p2 - m.vp->x );
  268. m.ruler_drawn = true;
  269. }
  270. /** callback called by Grid::draw_row_names() to draw an individual row name */
  271. void
  272. Canvas::draw_row_name ( int y, const char *name, int color )
  273. {
  274. bool draw = m.draw;
  275. bool clear = false;
  276. y = ntr( y );
  277. if ( ! m.row_compact && ! name )
  278. clear = true;
  279. y -= m.vp->y;
  280. int bx = m.origin_x;
  281. int by = m.origin_y + m.margin_top + y * m.div_h;
  282. int bw = min( m.margin_left, m.width / 8 );
  283. int bh = m.div_h;
  284. if ( y < 0 || y >= m.vp->h )
  285. draw = false;
  286. if ( clear && draw )
  287. gui_clear_area( bx, by, bw, bh );
  288. else
  289. m.margin_left = max( m.margin_left, gui_draw_string( bx, by,
  290. bw, bh,
  291. color,
  292. name,
  293. draw ) );
  294. }
  295. /** redraw row names */
  296. void
  297. Canvas::redraw_mapping ( void )
  298. {
  299. m.margin_left = 0;
  300. m.draw = false;
  301. m.grid->draw_row_names( this );
  302. resize();
  303. m.draw = true;
  304. m.grid->draw_row_names( this );
  305. m.mapping_drawn = true;
  306. }
  307. void
  308. Canvas::draw_mapping ( void )
  309. {
  310. if ( ! m.mapping_drawn ) redraw_mapping();
  311. }
  312. void
  313. Canvas::draw_ruler ( void )
  314. {
  315. if ( ! m.ruler_drawn ) redraw_ruler();
  316. }
  317. /** "draw" a shape in the backbuffer */
  318. void
  319. Canvas::draw_shape ( int x, int y, int shape, int state, int color, bool selected )
  320. {
  321. y = ntr( y );
  322. if ( y < 0 )
  323. return;
  324. // adjust for viewport.
  325. x -= m.vp->x;
  326. y -= m.vp->y;
  327. if ( x < 0 || y < 0 || x >= m.vp->w || y >= m.vp->h )
  328. return;
  329. m.current[ x ][ y ].shape = shape;
  330. m.current[ x ][ y ].color = color;
  331. m.current[ x ][ y ].state = (uint)m.vp->x + x > m.grid->ts_to_x( m.grid->length() ) ? PARTIAL : state;
  332. m.current[ x ][ y ].flags = selected ? F_SELECTED : 0;
  333. }
  334. /** callback used by Grid::draw() */
  335. void
  336. Canvas::draw_dash ( int x, int y, int l, int shape, int color, bool selected )
  337. {
  338. draw_shape( x, y, shape, FULL, color, selected );
  339. for ( int i = x + l - 1; i > x; i-- )
  340. {
  341. draw_shape( i, y, shape, CONTINUED, 0, selected );
  342. }
  343. }
  344. /** draw a vertical line with flags */
  345. void
  346. Canvas::draw_line ( int x, int flags )
  347. {
  348. for ( uint y = m.vp->h; y-- ; )
  349. m.current[ x ][ y ].flags |= flags;
  350. }
  351. /** draw only the playhead--without reexamining the grid */
  352. int
  353. Canvas::draw_playhead ( void )
  354. {
  355. int x = m.grid->ts_to_x( m.grid->index() );
  356. if ( m.playhead == x )
  357. return 0;
  358. m.playhead = x;
  359. if ( m.playhead < m.vp->x || m.playhead >= m.vp->x + m.vp->w )
  360. {
  361. if ( config.follow_playhead )
  362. {
  363. m.vp->x = m.playhead / m.vp->w * m.vp->w;
  364. m.ruler_drawn = false;
  365. signal_draw();
  366. return 0;
  367. }
  368. }
  369. copy();
  370. for ( uint x = m.vp->w; x-- ; )
  371. for ( uint y = m.vp->h; y-- ; )
  372. m.current[ x ][ y ].flags &= ~ (F_PLAYHEAD | F_P1 | F_P2 );
  373. flip();
  374. return 1;
  375. }
  376. /** draw ONLY those nodes necessary to bring the canvas up-to-date with the grid */
  377. void
  378. Canvas::draw ( void )
  379. {
  380. DEBUG( "drawing canvas" );
  381. draw_mapping();
  382. draw_ruler();
  383. m.grid_drawn = true;
  384. m.grid->draw( this, m.vp->x, m.vp->y, m.vp->w, m.vp->h );
  385. }
  386. /** redraw every node on the canvas from the buffer (without
  387. * necessarily reexamining the grid) */
  388. void
  389. Canvas::redraw ( void )
  390. {
  391. DEBUG( "redrawing canvas" );
  392. if ( ! m.grid_drawn )
  393. draw();
  394. m.ruler_drawn = false;
  395. m.mapping_drawn = false;
  396. draw_mapping();
  397. draw_ruler();
  398. for ( int y = m.vp->h; y--; )
  399. for ( int x = m.vp->w; x--; )
  400. {
  401. cell_t c = m.previous[ x ][ y ];
  402. if ( c.shape > HEXAGON ) return;
  403. if ( m.vp->x + x == m.playhead )
  404. c.flags |= F_PLAYHEAD;
  405. gui_draw_shape( m.origin_x + m.margin_left + x * m.div_w, m.origin_y + m.margin_top + y * m.div_h, m.div_w, m.div_h, m.border_w,
  406. c.shape, c.state, c.flags, c.color );
  407. }
  408. }
  409. /** convert pixel coords into grid coords. returns true if valid */
  410. bool
  411. Canvas::grid_pos ( int *x, int *y ) const
  412. {
  413. *y = (*y - m.margin_top - m.origin_y) / m.div_h;
  414. *x = (*x - m.margin_left - m.origin_x) / m.div_w;
  415. if ( *x < 0 || *y < 0 || *x >= m.vp->w || *y >= m.vp->h )
  416. return false;
  417. /* adjust for viewport */
  418. *x += m.vp->x;
  419. *y += m.vp->y;
  420. /* adjust for row-compaction */
  421. *y = rtn( *y );
  422. return true;
  423. }
  424. /******************/
  425. /* Input handlers */
  426. /******************/
  427. /* These methods translate viewport pixel coords to absolute grid
  428. coords and pass on to the grid. */
  429. /** if coords correspond to a row name entry, return the (absolute) note number, otherwise return -1 */
  430. int
  431. Canvas::is_row_name ( int x, int y )
  432. {
  433. if ( x - m.origin_x >= m.margin_left )
  434. return -1;
  435. x = m.margin_left;
  436. grid_pos( &x, &y );
  437. return m.grid->y_to_note( y );
  438. }
  439. void
  440. Canvas::set ( int x, int y )
  441. {
  442. if ( y - m.origin_y < m.margin_top )
  443. /* looks like a click on the ruler */
  444. {
  445. if ( x - m.margin_left - m.origin_x >= 0 )
  446. {
  447. m.p1 = m.vp->x + ((x - m.margin_left - m.origin_x) / m.div_w);
  448. m.ruler_drawn = false;
  449. }
  450. _lr();
  451. signal_draw();
  452. return;
  453. }
  454. if ( ! grid_pos( &x, &y ) )
  455. return;
  456. m.grid->put( x, y, 0 );
  457. }
  458. void
  459. Canvas::unset ( int x, int y )
  460. {
  461. if ( y - m.origin_y < m.margin_top )
  462. /* looks like a click on the ruler */
  463. {
  464. if ( x - m.margin_left - m.origin_x >= 0 )
  465. {
  466. m.p2 = m.vp->x + ((x - m.margin_left - m.origin_x) / m.div_w);
  467. m.ruler_drawn = false;
  468. }
  469. _lr();
  470. signal_draw();
  471. return;
  472. }
  473. if ( ! grid_pos( &x, &y ) )
  474. return;
  475. m.grid->del( x, y );
  476. }
  477. void
  478. Canvas::adj_color ( int x, int y, int n )
  479. {
  480. if ( ! grid_pos( &x, &y ) )
  481. return;
  482. m.grid->adj_velocity( x, y, n );
  483. }
  484. void
  485. Canvas::adj_length ( int x, int y, int n )
  486. {
  487. if ( ! grid_pos( &x, &y ) )
  488. return;
  489. m.grid->adj_duration( x, y, n );
  490. }
  491. void
  492. Canvas::select ( int x, int y )
  493. {
  494. if ( ! grid_pos( &x, &y ) )
  495. return;
  496. m.grid->select( x, y, true );
  497. }
  498. void
  499. Canvas::move_selected ( int dir, int n )
  500. {
  501. switch ( dir )
  502. {
  503. case RIGHT:
  504. m.grid->move_selected( n );
  505. break;
  506. case LEFT:
  507. m.grid->move_selected( 0 - n );
  508. break;
  509. case UP:
  510. case DOWN:
  511. {
  512. /* row-compaction makes this a little complicated */
  513. event_list *el = m.grid->events();
  514. /* FIXME: don't allow movement beyond the edges! */
  515. /* int hi, lo; */
  516. /* m.grid->selected_hi_lo_note( &hi, &lo ); */
  517. /* hi = ntr( hi ) > 0 ? ntr( hi ) : */
  518. /* if ( m.grid->y_to_note( ntr( hi ) ) ) */
  519. if ( dir == UP )
  520. for ( int y = 0; y <= m.maxh; ++y )
  521. el->rewrite_selected( m.grid->y_to_note( rtn( y ) ), m.grid->y_to_note( rtn( y - n ) ) );
  522. else
  523. for ( int y = m.maxh; y >= 0; --y )
  524. el->rewrite_selected( m.grid->y_to_note( rtn( y ) ), m.grid->y_to_note( rtn( y + n ) ) );
  525. m.grid->events( el );
  526. delete el;
  527. break;
  528. }
  529. }
  530. }
  531. void
  532. Canvas::randomize_row ( int y )
  533. {
  534. int x = m.margin_left;
  535. if ( ! grid_pos( &x, &y ) )
  536. return;
  537. ((pattern*)m.grid)->randomize_row( y, song.random.feel, song.random.probability );
  538. }
  539. void
  540. Canvas::_lr ( void )
  541. {
  542. int l, r;
  543. if ( m.p2 > m.p1 )
  544. {
  545. l = m.p1;
  546. r = m.p2;
  547. }
  548. else
  549. {
  550. l = m.p2;
  551. r = m.p1;
  552. }
  553. m.p1 = l;
  554. m.p2 = r;
  555. }
  556. void
  557. Canvas::select_range ( void )
  558. {
  559. m.grid->select( m.p1, m.p2 );
  560. }
  561. void
  562. Canvas::crop ( void )
  563. {
  564. m.grid->crop( m.p1, m.p2 );
  565. m.vp->x = 0;
  566. m.p2 = m.p2 - m.p1;
  567. m.p1 = 0;
  568. m.ruler_drawn = false;
  569. }
  570. void
  571. Canvas::delete_time ( void )
  572. {
  573. m.grid->delete_time( m.p1, m.p2 );
  574. }
  575. void
  576. Canvas::insert_time ( void )
  577. {
  578. m.grid->insert_time( m.p1, m.p2 );
  579. }
  580. /** paste range as new grid */
  581. void
  582. Canvas::duplicate_range ( void )
  583. {
  584. Grid *g = m.grid->clone();
  585. g->crop( m.p1, m.p2 );
  586. g->viewport.x = 0;
  587. }
  588. void
  589. Canvas::row_compact ( int n )
  590. {
  591. switch ( n )
  592. {
  593. case OFF:
  594. m.row_compact = false;
  595. m.maxh = 128;
  596. break;
  597. case ON:
  598. m.row_compact = true;
  599. m.vp->y = 0;
  600. _update_row_mapping();
  601. break;
  602. case TOGGLE:
  603. row_compact( m.row_compact ? OFF : ON );
  604. break;
  605. }
  606. _reset();
  607. m.mapping_drawn = false;
  608. }
  609. void
  610. Canvas::pan ( int dir, int n )
  611. {
  612. switch ( dir )
  613. {
  614. case LEFT: case RIGHT: case TO_PLAYHEAD: case TO_NEXT_NOTE: case TO_PREV_NOTE:
  615. /* handle horizontal movement specially */
  616. n *= m.grid->division();
  617. m.ruler_drawn = false;
  618. break;
  619. default:
  620. n *= 5;
  621. m.mapping_drawn = false;
  622. break;
  623. }
  624. switch ( dir )
  625. {
  626. case LEFT:
  627. m.vp->x = max( m.vp->x - n, 0 );
  628. break;
  629. case RIGHT:
  630. m.vp->x += n;
  631. break;
  632. case TO_PLAYHEAD:
  633. m.vp->x = m.playhead - (m.playhead % m.grid->division());
  634. break;
  635. case UP:
  636. m.vp->y = max( m.vp->y - n, 0 );
  637. break;
  638. case DOWN:
  639. m.vp->y = min( m.vp->y + n, m.maxh - m.vp->h );
  640. break;
  641. case TO_NEXT_NOTE:
  642. {
  643. int x = m.grid->next_note_x( m.vp->x );
  644. m.vp->x = x - (x % m.grid->division() );
  645. break;
  646. }
  647. case TO_PREV_NOTE:
  648. {
  649. int x = m.grid->prev_note_x( m.vp->x );
  650. m.vp->x = x - (x % m.grid->division() );
  651. break;
  652. }
  653. }
  654. signal_draw();
  655. }
  656. /** adjust horizontal zoom (* n) */
  657. void
  658. Canvas::h_zoom ( float n )
  659. {
  660. m.vp->w = max( 32, min( (int)(m.vp->w * n), 256 ) );
  661. resize_grid();
  662. }
  663. void
  664. Canvas::v_zoom_fit ( void )
  665. {
  666. if ( ! m.grid )
  667. return;
  668. changed_mapping();
  669. m.vp->h = m.maxh;
  670. m.vp->y = 0;
  671. resize_grid();
  672. }
  673. /** adjust vertical zoom (* n) */
  674. void
  675. Canvas::v_zoom ( float n )
  676. {
  677. m.vp->h = max( 1, min( (int)(m.vp->h * n), m.maxh ) );
  678. resize_grid();
  679. }
  680. void
  681. Canvas::notes ( char *s )
  682. {
  683. m.grid->notes( s );
  684. }
  685. char *
  686. Canvas::notes ( void )
  687. {
  688. return m.grid->notes();
  689. }