update to vue 2.5.16

Author: timelyportfolio

DESCRIPTION

@@ -1,8 +1,8 @@
 Package: vueR
 Type: Package
 Title: 'Vuejs' Helpers and 'Htmlwidget'
-Version: 0.4.0
-Date: 2017-10-10
+Version: 0.5.0
+Date: 2018-03-19
 Authors@R: c(
       person(
         "Evan","You"

LICENSE

@@ -1,6 +1,6 @@
 The MIT License (MIT)
 
-Copyright (c) 2015 
+Copyright (c) 2018
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

NEWS.md

@@ -1,3 +1,7 @@
+# vueR 0.5.0
+
+* Updated to Vue [2.5.16](https://github.com/vuejs/vue/releases/tag/v2.5.16)
+
 # vueR 0.4.0
 
 * Updated to Vue [2.4.4](https://github.com/vuejs/vue/releases/tag/v2.4.4)

R/meta.R

@@ -1,2 +1,2 @@
 #'@keywords internal
-vue_version <- function(){'2.4.4'}
+vue_version <- function(){'2.5.16'}

docs/LICENSE.html

@@ -137,9 +137,14 @@ pre, code {
   color: #333;
 }
 
-pre img {
+pre .img {
+  margin: 5px 0;
+}
+
+pre .img img {
   background-color: #fff;
   display: block;
+  height: auto;
 }
 
 code a, pre a {

docs/articles/index.html

@@ -5,4 +5,41 @@ $(function() {
     offset: 60
   });
 
+  var cur_path = paths(location.pathname);
+  $("#navbar ul li a").each(function(index, value) {
+    if (value.text == "Home")
+      return;
+    if (value.getAttribute("href") === "#")
+      return;
+
+    var path = paths(value.pathname);
+    if (is_prefix(cur_path, path)) {
+      // Add class to parent <li>, and enclosing <li> if in dropdown
+      var menu_anchor = $(value);
+      menu_anchor.parent().addClass("active");
+      menu_anchor.closest("li.dropdown").addClass("active");
+    }
+  });
 });
+
+function paths(pathname) {
+  var pieces = pathname.split("/");
+  pieces.shift(); // always starts with /
+
+  var end = pieces[pieces.length - 1];
+  if (end === "index.html" || end === "")
+    pieces.pop();
+  return(pieces);
+}
+
+function is_prefix(needle, haystack) {
+  if (needle.length > haystack.lengh)
+    return(false);
+
+  for (var i = 0; i < haystack.length; i++) {
+    if (needle[i] != haystack[i])
+      return(false);
+  }
+
+  return(true);
+}